Zobrazeno 1 - 10
of 234
pro vyhledávání: '"PODELSKI, ANDREAS"'
Commutativity has proven to be a powerful tool in reasoning about concurrent programs. Recent work has shown that a commutativity-based reduction of a program may admit simpler proofs than the program itself. The framework of lexicographical program
Externí odkaz:
http://arxiv.org/abs/2311.02673
Autor:
Padon, Oded, Hoenicke, Jochen, McMillan, Kenneth L., Podelski, Andreas, Sagiv, Mooly, Shoham, Sharon
Various verification techniques for temporal properties transform temporal verification to safety verification. For infinite-state systems, these transformations are inherently imprecise. That is, for some instances, the temporal property holds, but
Externí odkaz:
http://arxiv.org/abs/2106.00966
Publikováno v:
EPTCS 296, 2019, pp. 42-47
We present Ultimate TreeAutomizer, a solver for satisfiability of sets of constrained Horn clauses. Constrained Horn clauses (CHC) are a fragment of first order logic with attractive properties in terms of expressiveness and accessibility to algorith
Externí odkaz:
http://arxiv.org/abs/1907.03998
In theorem prover or SMT solver based verification, the program to be verified is often given in an intermediate verification language such as Boogie, Why, or CHC. This setting raises new challenges. We investigate a preprocessing step which takes th
Externí odkaz:
http://arxiv.org/abs/1901.01915
Publikováno v:
In Information and Computation November 2022 289 Part A
Autor:
Bogomolov, Sergiy, Forets, Marcelo, Frehse, Goran, Podelski, Andreas, Schilling, Christian, Viry, Frédéric
Publikováno v:
HSCC 2018
Approximating the set of reachable states of a dynamical system is an algorithmic yet mathematically rigorous way to reason about its safety. Although progress has been made in the development of efficient algorithms for affine dynamical systems, ava
Externí odkaz:
http://arxiv.org/abs/1801.09526
The CEGAR loop in software model checking notoriously diverges when the abstraction refinement procedure does not derive a loop invariant. An abstraction refinement procedure based on an SMT solver is applied to a trace, i.e., a restricted form of a
Externí odkaz:
http://arxiv.org/abs/1702.02369
Autor:
Morciniec, Tobias, Podelski, Andreas
During the execution of a test plan, a test manager may decide to drop a test case if its result can be inferred from already executed test cases. We show that it is possible to automatically generate a test plan to exploit the potential to justifiab
Externí odkaz:
http://arxiv.org/abs/1612.04351