swMATH8510MaRDI QIDQ20519FDOQ20519
Author name not available (Why is that?)
Official website: http://link.springer.com/chapter/10.1007%2F3-540-11494-7_22
Cited In (only showing first 100 items - show all)
- A complete proof system for propositional projection temporal logic
- Real-Time Systems
- Alternating automata: unifying truth and validity checking for temporal logics
- Towards a notion of unsatisfiable and unrealizable cores for LTL
- Interrupt timed automata: verification and expressiveness
- Reasoning about networks with many identical finite state processes
- SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR
- Characterizing finite Kripke structures in propositional temporal logic
- Module checking
- Title not available (Why is that?)
- An automata-theoretic approach to infinite-state systems
- Symbolic model checking with rich assertional languages
- Enhanced vacuity detection in linear temporal logic.
- Coverage metrics for temporal logic model checking
- Fairness and related properties in transition systems - a temporal logic to deal with fairness
- An automata-theoretic approach to branching-time model checking
- Priority scheduling of distributed systems based on model checking
- Before and after vacuity
- Solving parity games using an automata-based algorithm
- Bounded model checking using satisfiability solving
- ATL with strategy contexts: expressiveness and model checking
- MCGP
- Compositional analysis for verification of parameterized systems
- ALGOL 68
- Zing
- rCOS
- veriSoft
- CalFuzzer
- PREVAIL
- SLAM
- SPIN
- NuSMV
- LoLA
- Punf
- ARMC
- NeVer
- SCR
- Zap
- ADL
- Bandera
- jSpin
- Java PathFinder
- Cadence SMV
- Roboop
- Bebop
- Motras
- ConTest
- eVolCheck
- SATORI
- MIO Workbench
- dSPIN
- JPAX
- CCured
- TLC
- MOPS
- LTL2BA
- JPF-SE
- UNITY
- RATSY
- VaqTree
- Algebraic simulations
- Title not available (Why is that?)
- Looper
- Esterel
- Limi
- Liss
- LASH
- Murphi
- CHESS
- ANaConDA
- MCMAS-SLK
- CATG
- VeriFlow
- ComLisp
- KoMeT
- Piton
- CLDC
- MSVL
- \textsc{NeVer}: a tool for artificial neural networks verification
- Verification and refutation of probabilistic specifications via games
- Title not available (Why is that?)
- From pre-historic to post-modern symbolic model checking
- Con2colic
- Papyrus-RT
- VIS
- A mechanism of function calls in MSVL
- Title not available (Why is that?)
- Beyond vacuity: towards the strongest passing formula
- Title not available (Why is that?)
- A formal proof of the deadline driven scheduler in PPTL axiomatic system
- Formal modeling and verification for MVB
- Model-checking precision agriculture logistics: the case of the differential harvest
- An experience in proving regular networks of processes by modular model checking
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions
- Dependences in strategy logic
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
- Automated analysis of mutual exclusion algorithms using CCS
- Title not available (Why is that?)
- Automatic verification of timed concurrent constraint programs
This page was built for software: CESAR
