The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
High-level symbolic construction technique for high performance sequential synthesis
DAC '93 Proceedings of the 30th international Design Automation Conference
High-Level specification and automatic generation of IP interface monitors
Proceedings of the 39th annual Design Automation Conference
Dynamic Logic
A topological characterization of weakness
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A Practical Introduction to PSL (Series on Integrated Circuits and Systems)
A Practical Introduction to PSL (Series on Integrated Circuits and Systems)
The definition of a temporal clock operator
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the characterization of until as a fixed point under clocked semantics
HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
Some complexity results for systemverilog assertions
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Linear time logics around PSL: complexity, expressiveness, and a little bit of succinctness
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Formal semantics for PSL modeling layer and application to the verification of transactional models
Proceedings of the Conference on Design, Automation and Test in Europe
SVA and PSL local variables - a practical approach
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not control the behavior of the atomic propositions, it merely observes their behavior. Local variables are a twist on this approach, in which the user can declare variables local to the formula and control their behavior from within the formula itself. Local variables were introduced in 2002, and a formal semantics was given to them in the context of SVA, the assertion language of System Verilog, in 2004. That semantics suffers from several drawbacks. In particular, it breaks distributivity of the operators corresponding to intersection and union. In this paper we present a formal semantics for local variables that solves that problem and others, and compare it to the previous solution.