Functional specification of hardware via temporal logic
From MaRDI portal
Recommendations
Cites work
- A topological characterization of weakness
- Branching vs. linear time: Final showdown
- Complete Proof System for QPTL
- Correct Hardware Design and Verification Methods
- Defining liveness
- Efficient decision procedures for model checking of linear time logic properties
- Embedding finite automata within regular expressions
- FoCs -- automatic generation of simulation checkers from formal specifications
- From Church and Prior to PSL
- Hardware and Software, Verification and Testing
- scientific article; zbMATH DE number 438994 (Why is no real title available?)
- scientific article; zbMATH DE number 3848604 (Why is no real title available?)
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3876574 (Why is no real title available?)
- scientific article; zbMATH DE number 3940713 (Why is no real title available?)
- scientific article; zbMATH DE number 4027441 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 2196589 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
- Model checking of safety properties
- Process logic with regular formulas
- Process logic: Expressiveness, decidability, completeness
- Propositional dynamic logic of regular programs
- Reasoning with temporal logic on truncated paths.
- Recognizing safety and liveness
- Resets vs. aborts in linear temporal logic
- Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations
- Some Complexity Results for SystemVerilog Assertions
- Star-free regular sets of ω-sequences
- State complexity of chop operations on unary and finite languages
- Succinctness of Regular Expressions with Interleaving, Intersection and Counting
- Succinctness of the complement and intersection of regular expressions
- Temporal logic can be more expressive
- The complementation problem for Büchi automata with applications to temporal logic
- The complexity of propositional linear temporal logics
- The definition of a temporal clock operator
- The ForSpec temporal logic: A new temporal property-specification language
- The temporal logic Sugar
- Validating the PSL/Sugar semantics using automated reasoning
Cited in
(5)
This page was built for publication: Functional specification of hardware via temporal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176382)