Sciweavers

501 search results - page 12 / 101
» Using Abstraction to Verify Arbitrary Temporal Properties
Sort
View
ESOP
2010
Springer
13 years 10 months ago
TRX: A Formally Verified Parser Interpreter
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser inter...
Adam Koprowski, Henri Binsztok
ICWE
2005
Springer
14 years 27 days ago
The Role of Visual Tools in a Web Application Design and Verification Framework: A Visual Notation for LTL Formulae
As the Web becomes a platform for implementing complex B2C and B2B applications, there is a need to extend Web conceptual modeling to process-centric applications. In this context,...
Marco Brambilla, Alin Deutsch, Liying Sui, Victor ...
TACAS
2004
Springer
135views Algorithms» more  TACAS 2004»
14 years 22 days ago
Liveness with Incomprehensible Ranking
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...
Yi Fang, Nir Piterman, Amir Pnueli, Lenore D. Zuck
GLOBECOM
2007
IEEE
13 years 11 months ago
Complex Nakagami Channel Simulator with Accurate Phase and Auto-Correlation Properties
Accurate and systematic channel simulation technique is critical for performance verification of digital transceiver design over wireless channels. Despite the abundant results on ...
Yao Ma, Dongbo Zhang
CANS
2009
Springer
136views Cryptology» more  CANS 2009»
14 years 2 months ago
Verifying Anonymous Credential Systems in Applied Pi Calculus
Abstract. Anonymous credentials are widely used to certify properties of a credential owner or to support the owner to demand valuable services, while hiding the user’s identity ...
Xiangxi Li, Yu Zhang, Yuxin Deng