184 search results - page 31 / 37 » Formal Verification of an Optimizing Compiler |
POPL
1998
ACM
13 years 11 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Smart play-out is a method for executing declarative scenariobased specifications, which utilizes powerful computation methods to compute safe supersteps, thus helping t...
HASKELL
2009
ACM
14 years 2 months ago
2009
ACM
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
ICESS
2007
Springer
14 years 1 months ago
2007
Springer
Embedded software requires concurrency formalisms other than threads and mutexes used in traditional programming languages like C. Actor-oriented design presents a high level abstr...
EACL
2003
ACL Anthology
13 years 8 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...