Zobrazeno 1 - 10
of 1 888
pro vyhledávání: '"d.2.4"'
Autor:
Thompson, Kyle, Saavedra, Nuno, Carrott, Pedro, Fisher, Kevin, Sanchez-Stern, Alex, Brun, Yuriy, Ferreira, João F., Lerner, Sorin, First, Emily
Formal verification using proof assistants, such as Coq, enables the creation of high-quality software. However, the verification process requires significant expertise and manual effort to write proofs. Recent work has explored automating proof synt
Externí odkaz:
http://arxiv.org/abs/2412.14063
Autor:
Bakshi, Gargi, Joshi, Rushikesh K.
Dynamic changes in processes necessitate the notion of state equivalence between the old and new workflows. In several cases, the history of the workflow to be migrated provides sufficient context for a meaningful migration. In this paper, we present
Externí odkaz:
http://arxiv.org/abs/2412.08314
Publikováno v:
EPTCS 414, 2024, pp. 58-76
Process algebras have been widely used to verify security protocols in a formal manner. However they mostly focus on synchronous communication based on the exchange of messages. We present an alternative approach relying on asynchronous communication
Externí odkaz:
http://arxiv.org/abs/2412.08235
Autor:
Heuvel, Bas van den, Pérez, Jorge A.
Publikováno v:
EPTCS 414, 2024, pp. 1-20
While formal models of concurrency tend to focus on synchronous communication, asynchronous communication is relevant in practice. In this paper, we will discuss asynchronous communication in the context of session-based concurrency, the model of com
Externí odkaz:
http://arxiv.org/abs/2412.08232
Model finding, as embodied by SAT solvers and similar tools, is used widely, both in embedding settings and as a tool in its own right. For instance, tools like Alloy target SAT to enable users to incrementally define, explore, verify, and diagnose s
Externí odkaz:
http://arxiv.org/abs/2412.03310
Autor:
Danvy, Olivier
Publikováno v:
EPTCS 413, 2024, pp. 57-92
Seventy years on, Moessner's theorem and Moessner's process -- i.e., the additive computation of integral powers -- continue to fascinate. They have given rise to a variety of elegant proofs, to an implementation in hardware, to generalizations, and
Externí odkaz:
http://arxiv.org/abs/2412.03127
Autor:
Zhang, Changjian, Kapoor, Parv, Dardik, Ian, Cui, Leyi, Meira-Goes, Romulo, Garlan, David, Kang, Eunsuk
Temporal logic specifications play an important role in a wide range of software analysis tasks, such as model checking, automated synthesis, program comprehension, and runtime monitoring. Given a set of positive and negative examples, specified as t
Externí odkaz:
http://arxiv.org/abs/2412.02905
Autor:
Garcia, Rémi, Modesti, Paolo
Publikováno v:
Electronics, Volume 13, Number 23, 2024
To develop trustworthy distributed systems, verification techniques and formal methods, including lightweight and practical approaches, have been employed to certify the design or implementation of security protocols. Lightweight formal methods offer
Externí odkaz:
http://arxiv.org/abs/2411.17926
Autor:
Erhard, Julian, Bentele, Manuel, Heizmann, Matthias, Klumpp, Dominik, Saan, Simmo, Schüssele, Frank, Schwarz, Michael, Seidl, Helmut, Tilscher, Sarah, Vojdani, Vesal
Static analyzers are typically complex tools and thus prone to contain bugs themselves. To increase the trust in the verdict of such tools, witnesses encode key reasoning steps underlying the verdict in an exchangeable format, enabling independent va
Externí odkaz:
http://arxiv.org/abs/2411.16612
We study the problem of bounding the posterior distribution of discrete probabilistic programs with unbounded support, loops, and conditioning. Loops pose the main difficulty in this setting: even if exact Bayesian inference is possible, the state of
Externí odkaz:
http://arxiv.org/abs/2411.10393