Sciweavers

136 search results - page 5 / 28
» A Provably Correct Compiler Generator
Sort
View
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
13 years 11 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
KR
2010
Springer
14 years 12 days ago
A Correctness Result for Reasoning about One-Dimensional Planning Problems
A plan with rich control structures like branches and loops can usually serve as a general solution that solves multiple planning instances in a domain. However, the correctness o...
Yuxiao Hu, Hector J. Levesque
ICST
2008
IEEE
14 years 2 months ago
A JML Compiler Based on AspectJ
The Java Modeling Language (JML) is a behavioral interface specification language (BISL) designed for Java. It was developed with the aim of improving the functional software cor...
Henrique Rebêlo, Ricardo Massa Ferreira Lima...
PPDP
2005
Springer
14 years 1 months ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...
ASM
2004
ASM
14 years 1 months ago
An ASM Semantics for SSA Intermediate Representations
Abstract. Static single assignment (SSA) form is the intermediate representation of choice in modern optimizing compilers for which no formal semantics has been stated yet. To prov...
Sabine Glesner