The following pages link to (Q4804909):
Displaying 50 items.
- \texttt{VeriSIMPL 2}: an open-source software for the verification of max-plus-linear systems (Q262437) (← links)
- Verifying safety properties of a nonlinear control by interactive theorem proving with the prototype verification system (Q264193) (← links)
- Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
- Analysing sanity of requirements for avionics systems (Q282095) (← links)
- Verification of \(\mathrm{EB}^3\) specifications using CADP (Q282110) (← links)
- Bounded situation calculus action theories (Q286407) (← links)
- An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints (Q414857) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- A decidability result for the model checking of infinite-state systems (Q438572) (← links)
- Interrupt timed automata: verification and expressiveness (Q453513) (← links)
- Symbolic bounded synthesis (Q453535) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- Component-wise incremental LTL model checking (Q510894) (← links)
- Bisimulation conversion and verification procedure for goal-based control systems (Q633304) (← links)
- Verification of consensus algorithms using satisfiability solving (Q658669) (← links)
- Synthesis of obfuscation policies to ensure privacy and utility (Q682359) (← links)
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability (Q729813) (← links)
- Time-budgeting: a component based development methodology for real-time embedded systems (Q736795) (← links)
- Program repair without regret (Q746769) (← links)
- Using formal verification to evaluate the execution time of Spark applications (Q782497) (← links)
- Translating Java for multiple model checkers: The Bandera back-end (Q816196) (← links)
- Timed hyperproperties (Q821560) (← links)
- Model checking \(\omega \)-regular properties with decoupled search (Q832281) (← links)
- Action language verifier: An infinite-state model checker for reactive software specifications (Q845244) (← links)
- Early verification and validation of mission critical systems (Q883137) (← links)
- HRELTL: a temporal logic for hybrid systems (Q897648) (← links)
- Agent planning programs (Q899440) (← links)
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning (Q934706) (← links)
- Automatic symbolic compositional verification by learning assumptions (Q934713) (← links)
- On regular temporal logics with past (Q977176) (← links)
- An executable specification of a formal argumentation protocol (Q1028953) (← links)
- A rigorous methodology for specification and verification of business processes (Q1037243) (← links)
- A compiler for MSVL and its applications (Q1630985) (← links)
- Falsification of combined invariance and reachability specifications in hybrid control systems (Q1693831) (← links)
- An explicit transition system construction approach to LTL satisfiability checking (Q1707341) (← links)
- A first-order coalition logic for BDI-agents (Q1712430) (← links)
- Modeling and querying biomolecular interaction networks (Q1884862) (← links)
- Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice (Q1884863) (← links)
- Spiking neural P systems: matrix representation and formal verification (Q1983014) (← links)
- Search-based testing in membrane computing (Q1983028) (← links)
- Producing explanations for rich logics (Q2024339) (← links)
- Formal verification of timed synchronous dataflow graphs using lustre (Q2043814) (← links)
- TOrPEDO : witnessing model correctness with topological proofs (Q2065548) (← links)
- Diagnosability verification using LTL model checking (Q2081084) (← links)
- Automatic synthesis of transiently correct network updates via Petri games (Q2117163) (← links)
- The ASMETA approach to safety assurance of software systems (Q2117597) (← links)
- Greening R. Thomas' framework with environment variables: a divide and conquer approach (Q2142101) (← links)
- Aeon 2021: bifurcation decision trees in Boolean networks (Q2142120) (← links)
