Bounded semantics
From MaRDI portal
Publication:483292
DOI10.1016/j.tcs.2014.10.026zbMath1317.68105OpenAlexW4206146107MaRDI QIDQ483292
Publication date: 16 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.026
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items
Linear templates of ACTL formulas with an application to SAT-based verification ⋮ Unnamed Item ⋮ Alternating-time temporal logic ATL with finitely bounded semantics ⋮ Bounded game-theoretic semantics for modal mu-calculus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
- Bounded model checking for knowledge and real time
- The temporal semantics of concurrent programs
- Myths about the mutual exclusion problem
- Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
- A New Approach to Bounded Model Checking for Branching Time Logics
- Graph-Based Algorithms for Boolean Function Manipulation
- “Sometimes” and “not never” revisited
- Linear Encodings of Bounded LTL Model Checking
- Theory and Applications of Satisfiability Testing
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Computer Aided Verification
- Verification, Model Checking, and Abstract Interpretation
- Software reliability methods. Foreword by Edmund M. Clarke
- Bounded model checking using satisfiability solving
This page was built for publication: Bounded semantics
