scientific article; zbMATH DE number 1903365
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Unbeast: Symbolic Bounded Synthesis
- Kernel P systems modelling, testing and verification -- sorting case study
- 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
- Constrained Kripke structure for identifying parameters of biological models
- Proving stabilization of biological systems
- Model Checking Contracts – A Case Study
- \texttt{VeriSIMPL 2}: an open-source software for the verification of max-plus-linear systems
- Verifying safety properties of a nonlinear control by interactive theorem proving with the prototype verification system
- Extracting unsatisfiable cores for LTL via temporal resolution
- Model checking \(\omega \)-regular properties with decoupled search
- SMT-based scenario verification for hybrid systems
- Translating Xd-C programs to MSVL programs
- NuMDG: a new tool for multiway decision graphs construction
- Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
- Parameterized Synthesis of Self-Stabilizing Protocols in Symmetric Rings
- Model checking merged program traces
- Interrupt timed automata: verification and expressiveness
- 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
- Kernel P systems: from modelling to verification and testing
- 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
- 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
- Computer Aided Verification
- Analysing sanity of requirements for avionics systems
- Verification of \(\mathrm{EB}^3\) specifications using CADP
- Bounded situation calculus action theories
- A Multi-Core Solver for Parity Games
- ZDD-based algorithmic framework for solving shortest reconfiguration problems
- Learning Meets Verification
- Automatic symbolic compositional verification by learning assumptions
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- An automatic method for the dynamic construction of abstractions of states of a formal model
- SAT-solving in CSP trace refinement
- A decidability result for the model checking of infinite-state systems
- BDD-based symbolic model checking
- Synthesis of succinct systems
- Recasting Constraint Automata into Büchi Automata
- Verification and enforcement of access control policies
- Producing explanations for rich logics
- Formal verification of temporal properties for reduced overhead in grid scientific workflows
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- Temporal property verification as a program analysis task
- Linear-Time Model Checking: Automata Theory in Practice
- Aeon 2021: bifurcation decision trees in Boolean networks
- Greening R. Thomas' framework with environment variables: a divide and conquer approach
- A new rule for LTL tableaux
- A backward-traversal-based approach for symbolic model checking of uniform strategies for constrained reachability
- Symbolic bounded synthesis
- Strategies, model checking and branching-time properties in Maude
- Early verification and validation of mission critical systems
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics
- Social bot detection as a temporal logic model checking problem
- Theorem proving for pointwise metric temporal logic over the naturals via translations
- Modeling and querying biomolecular interaction networks
- Using Bounded Model Checking to Verify Consensus Algorithms
- Model checking of biological systems
- Program repair without regret
- Formal verification of timed synchronous dataflow graphs using Lustre
- AutoHyper: explicit-state model checking for HyperLTL
- Symbolic model checking the knowledge in Herbivore protocol
- Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams
- Verification Modulo theories
- Synthesis of obfuscation policies to ensure privacy and utility
- Deciding Bit-Vector Formulas with mcSAT
- Linear temporal logic symbolic model checking
- Model Revision from Temporal Logic Properties in Computational Systems Biology
- Testing Distributed Systems Through Symbolic Model Checking
- A model learning based testing approach for kernel P systems
- scientific article; zbMATH DE number 1744965 (Why is no real title available?)
- HRELTL: a temporal logic for hybrid systems
- Agent planning programs
- From Monadic Logic to PSL
- Automata-Theoretic Model Checking Revisited
- Symbolic CTL model checking of asynchronous systems using constrained saturation
- An executable specification of a formal argumentation protocol
- Formal verification technique for grid service chain model and its application
- Analysis of UML Activities Using Dynamic Meta Modeling
- Tighter construction of tight Büchi automata
- A New Approach for the Construction of Multiway Decision Graphs
- A rigorous methodology for specification and verification of business processes
- Time-budgeting: a component based development methodology for real-time embedded systems
- Bisimulation conversion and verification procedure for goal-based control systems
- From Philosophical to Industrial Logics
- Fair multi-party contract signing using private contract signatures
- Verification of Boolean programs with unbounded thread creation
- Integrating topological proofs with model checking to instrument iterative design
- N-PAT: A Nested Model-Checker
- Modeling and analysis of gene regulatory networks
- Using formal verification to evaluate the execution time of Spark applications
- Towards better heuristics for solving bounded model checking problems
- Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4804909)
