100 search results - page 16 / 20 » Linear-Time Model Checking: Automata Theory in Practice |
118
click to vote
PPDP
2010
Springer
14 years 10 months ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
120
click to vote
ENTCS
2007
15 years 10 days ago
2007
This paper gives an overview of recent advances in Real-Time Maude. Real-Time Maude extends the Maude rewriting logic tool to support formal specification and analysis of object-...
114
Voted
EMSOFT
2006
Springer
15 years 4 months ago
2006
Springer
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has...
139
Voted
PODS
1994
ACM
15 years 4 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
150
click to vote
SBMF
2010
Springer
14 years 7 months ago
2010
Springer
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...