A stubborn attack on state explosion
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
Stutter-invariant temporal properties are expressible without the next-time operator
Information Processing Letters
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
A note on a question of Peled and Wilke regarding stutter-invariant LTL
Information Processing Letters
Partial-Order Reduction in Symbolic State-Space Exploration
Formal Methods in System Design - Special issue on CAV '97
Expressive Completeness of Temporal Logic of Action
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Ten Years of Partial Order Reduction
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Stutter-Invariant Languages, omega-Automata, and Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
RuleBase: Model Checking at IBM
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
On Regular Temporal Logics with Past,
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Some complexity results for systemverilog assertions
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Linear time logics around PSL: complexity, expressiveness, and a little bit of succinctness
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.00 |
We present specification languages that naturally capture exactly the regular and *** -regular properties that are stutter invariant. Our specification languages are variants of the classical regular expressions and of the core of PSL, a temporal logic, which is widely used in industry and which extends the classical linear-time temporal logic LTL by semi-extended regular expressions.