883 search results - page 2 / 177 » The Semantics of Verilog Using Transition System Combinators |
IPPS
2003
IEEE
14 years 29 days ago
2003
IEEE
This paper investigates a complexity-effective technique for verifying a highly distributed directory-based cache coherence protocol. We develop a novel approach called “witnes...
LPNMR
1990
Springer
13 years 11 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
FUIN
2006
13 years 7 months ago
2006
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
IANDC
2011
13 years 2 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...