Cited in
(only showing first 100 items - show all)- Formal Verification Based on Guided Random Walks
- Unbeast: Symbolic Bounded Synthesis
- Kernel P systems modelling, testing and verification -- sorting case study
- scientific article; zbMATH DE number 1956587 (Why is no real title available?)
- A formalisation of violation, error recovery, and enforcement in the bit transmission problem
- Computer Aided Verification
- Timed hyperproperties
- scientific article; zbMATH DE number 7445165 (Why is no real title available?)
- Spiking neural P systems: matrix representation and formal verification
- Search-based testing in membrane computing
- Bio-PEPA: A framework for the modelling and analysis of biological systems
- Symbolic Model Checking of Logics with Actions
- Quo vadis explicit-state model checking
- A method for CTL model update, representing Kripke structures as ``table systems
- Symbolic synthesis of masking fault-tolerant distributed programs
- Proving stabilization of biological systems
- Model Checking Contracts – A Case Study
- An integrated approach to P systems formal verification
- \texttt{VeriSIMPL 2}: an open-source software for the verification of max-plus-linear systems
- scientific article; zbMATH DE number 1670775 (Why is no real title available?)
- Verifying safety properties of a nonlinear control by interactive theorem proving with the prototype verification system
- Extracting unsatisfiable cores for LTL via temporal resolution
- Pardinus: a temporal relational model finder
- Not all bugs are created equal, but robust reachability can tell the difference
- Model checking \(\omega \)-regular properties with decoupled search
- scientific article; zbMATH DE number 1903365 (Why is no real title available?)
- SMT-based scenario verification for hybrid systems
- Translating Xd-C programs to MSVL programs
- Automata theory and model checking
- The Birth of Model Checking
- NuMDG: a new tool for multiway decision graphs construction
- Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
- scientific article; zbMATH DE number 2086516 (Why is no real title available?)
- Model checking merged program traces
- PuRSUE -- from specification of robotic environments to synthesis of controllers
- Interrupt timed automata: verification and expressiveness
- Linear Encodings of Bounded LTL Model Checking
- Performance heuristics for GR(1) synthesis and related algorithms
- On regular temporal logics with past
- Enhancing unsatisfiable cores for LTL with information on temporal relevance
- scientific article; zbMATH DE number 2150806 (Why is no real title available?)
- Towards light-weight probabilistic model checking
- Finding State Solutions to Temporal Logic Queries
- Semantic consistency checking in building ontology from heterogeneous sources
- Symbolic model checking of actor-oriented high-level SystemC models with interval diagrams
- scientific article; zbMATH DE number 1950556 (Why is no real title available?)
- Towards an efficient library for SAT: A manifesto
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- Representing and Reasoning about Temporal Granularities
- scientific article; zbMATH DE number 1950659 (Why is no real title available?)
- Reasoning about evolving nonmonotonic knowledge bases
- scientific article; zbMATH DE number 1951084 (Why is no real title available?)
- Kernel P systems: from modelling to verification and testing
- scientific article; zbMATH DE number 1951085 (Why is no real title available?)
- An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints
- An explicit transition system construction approach to LTL satisfiability checking
- Automatic synthesis of transiently correct network updates via Petri games
- The ASMETA approach to safety assurance of software systems
- Computer Aided Verification
- Model Checking on Trees with Path Equivalences
- Toward model selection by formal methods
- Action language verifier: An infinite-state model checker for reactive software specifications
- Formal dependability modeling and analysis: a survey
- Bounded LTL model checking with stable models
- Conformant planning via symbolic model checking and heuristic search
- Analysing sanity of requirements for avionics systems
- Verification of \(\mathrm{EB}^3\) specifications using CADP
- Bounded situation calculus action theories
- On the model checking of a system consisting of many similar components
- Strong planning under partial observability
- A Multi-Core Solver for Parity Games
- Symbolic Fault Tree Analysis for Reactive Systems
- Verification from Declarative Specifications Using Logic Programming
- Automatic symbolic compositional verification by learning assumptions
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Incremental learning-based testing for reactive systems
- Polsat
- An automatic method for the dynamic construction of abstractions of states of a formal model
- Interactive verification of architectural design patterns in FACTum
- Test generation from P systems using model checking
- Verifying a network invariant for all configurations of the Futurebus+ cache coherence protocol
- Evaluation of cyber security and modelling of risk propagation with Petri nets
- Verifying data refinements using a model checker
- Applying model-checking to solve queries on semistructured data
- Bounded Model Checking for Weak Alternating Büchi Automata
- Experimental Evaluation of Classical Automata Constructions
- scientific article; zbMATH DE number 1956607 (Why is no real title available?)
- A Framework for Model Checking Institutions
- A logical framework for systems biology
- Data structures for symbolic multi-valued model-checking
- Representing and reasoning with qualitative preferences for compositional systems
- scientific article; zbMATH DE number 2087616 (Why is no real title available?)
- Fairness modulo theory: a new approach to LTL software model checking
- SAT-solving in CSP trace refinement
- A decidability result for the model checking of infinite-state systems
- Bounded Model Checking Real-Time Multi-agent Systems with Clock Differences: Theory and Implementation
- The formal-CAFE methodology and model checking patterns in the specification of e-commerce systems
- BDD-based symbolic model checking
- R. Thomas' modeling of biological regulatory networks: Introduction of singular states in the qualitative dynamics
This page was built for software: NuSMV
