Sciweavers

4693 search results - page 437 / 939
» Verifying Hybrid Systems
Sort
View
SRDS
2000
IEEE
15 years 11 months ago
Detection of Livelocks in Communication Protocols by Means of a Polygon Time Structure
As has been shown, the polygon time structure overcomes the main limitations of the interval time structure, and allows to verify communication protocols, in which the explicit co...
Jerzy Brzezinski, Michal Sajkowski
POPL
1997
ACM
15 years 11 months ago
Proof-Carrying Code
Proof-carrying code is a framework for the mechanical verification of safety properties of machine language programs, but the problem arises of quis custodiat ipsos custodes—wh...
George C. Necula
CAV
1994
Springer
73views Hardware» more  CAV 1994»
15 years 11 months ago
A Parallel Algorithm for Relational Coarsest Partition Problems and Its Implementation
Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are P-complete and hence it may not be possible to design ...
Insup Lee, Sanguthevar Rajasekaran
FMCAD
2006
Springer
15 years 10 months ago
Thorough Checking Revisited
Recent years have seen a proliferation of 3-valued or capturing abstractions of systems, since these enable verifying both universal and existential properties. Reasoning about suc...
Shiva Nejati, Mihaela Gheorghiu, Marsha Chechik
ELPUB
2008
ACM
15 years 8 months ago
Keyword and metadata extraction from pre-prints
In this paper we study how to provide metadata for a pre-print archive. Metadata includes, but is not limited to, title, authors, citations, and keywords, and is used to both pres...
Emma Tonkin, Henk L. Muller