Journal ArticleDOI
Satisfiability modulo theories: introduction and applications
Reads0
Chats0
TLDR
Checking the satisfiability of logical formulas, SMT solvers scale orders of magnitude beyond custom ad hoc solvers.Abstract:
Checking the satisfiability of logical formulas, SMT solvers scale orders of magnitude beyond custom ad hoc solvers.read more
Citations
More filters
Journal ArticleDOI
Symbolic execution for software testing: three decades later
Cristian Cadar,Koushik Sen +1 more
TL;DR: The challenges---and great promise---of modern symbolic execution techniques, and the tools to help implement them.
Journal ArticleDOI
Review: Cloud computing service composition: A systematic literature review
TL;DR: By dividing the research into four main groups based on the problem-solving approaches and identifying the investigated quality of service parameters, intended objectives, and developing environments, beneficial results and statistics are obtained that can contribute to future research.
Proceedings ArticleDOI
Syntax-guided synthesis
Rajeev Alur,Rastislav Bodik,Garvit Juniwal,Milo M. K. Martin,Mukund Raghothaman,Sanjit A. Seshia,Rishabh Singh,Armando Solar-Lezama,Emina Torlak,Abhishek Udupa +9 more
TL;DR: This work describes three different instantiations of the counter-example-guided-inductive-synthesis (CEGIS) strategy for solving the synthesis problem, reports on prototype implementations, and presents experimental results on an initial set of benchmarks.
Proceedings ArticleDOI
Scheduling Real-Time Communication in IEEE 802.1Qbv Time Sensitive Networks
TL;DR: This paper identifies and analyzes key functional parameters affecting the deterministic behaviour of real-time communication under 802.1Qbv and derives the required constraints for computing offline schedules guaranteeing low and bounded jitter and deterministic end-to-end latency for critical communication flows.
Journal ArticleDOI
A Survey of Symbolic Execution Techniques
TL;DR: A survey of the main challenges, challenges, and solutions for symbolic execution can be found in this paper, where the authors provide an overview of main ideas, challenges and solutions developed in the area.
References
More filters
Book ChapterDOI
Z3: an efficient SMT solver
TL;DR: Z3 is a new and efficient SMT Solver freely available from Microsoft Research that is used in various software verification and analysis applications.
Proceedings ArticleDOI
The complexity of theorem-proving procedures
TL;DR: It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology.
Book
A machine program for theorem-proving
TL;DR: The programming of a proof procedure is discussed in connection with trial runs and possible improvements.
Proceedings ArticleDOI
Extended static checking for Java
TL;DR: The Extended Static Checker for Java (ESC/Java) is introduced, an experimental compile-time program checker that finds common programming errors and provides programmers with a simple annotation language with which programmer design decisions can be expressed formally.