Sciweavers

6829 search results - page 294 / 1366
» Quantitative Generalizations of Languages
Sort
View
DLS
2008
213views Languages» more  DLS 2008»
15 years 8 months ago
A parsing machine for PEGs
Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEG...
Sérgio Medeiros, Roberto Ierusalimschy
ENTCS
2008
78views more  ENTCS 2008»
15 years 6 months ago
Silver: an Extensible Attribute Grammar System
Attribute grammar specification languages, like many domain specific languages, offer significant advantages to their users, such as high-level declarative constructs and domain-s...
Eric Van Wyk, Derek Bodin, Jimin Gao, Lijesh Krish...
WWW
2005
ACM
16 years 7 months ago
Soundness proof of Z semantics of OWL using institutions
The correctness of the Z semantics of OWL is the theoretical foundation of using software engineering techniques to verify Web ontologies. As OWL and Z are based on different logi...
Dorel Lucanu, Yuan-Fang Li, Jin Song Dong
POPL
2007
ACM
16 years 7 months ago
Modular verification of a non-blocking stack
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
Matthew J. Parkinson, Richard Bornat, Peter W. O'H...
POPL
2006
ACM
16 years 7 months ago
Hybrid type checking
Traditional static type systems are very effective for verifying basic interface specifications, but are somewhat limited in the kinds specificationsthey support. Dynamically-chec...
Cormac Flanagan