Sciweavers

1288 search results - page 131 / 258
» Integrating formal models into the programming languages cou...
Sort
View
POPL
2004
ACM
16 years 6 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
159
Voted
CC
2010
Springer
172views System Software» more  CC 2010»
16 years 29 days ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...
NMR
2004
Springer
15 years 11 months ago
Semantics of disjunctive programs with monotone aggregates - an operator-based approach
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
Nikolay Pelov, Miroslaw Truszczynski
189
Voted
AGTIVE
2007
Springer
16 years 9 days ago
Aspect Diagrams for UML Activity Models
Abstract. Aspect-orientation has gained increasing popularity, especially within the programming domain, with textual-based approaches such as AspectJ. Aspect-orientation provides ...
Roy Grønmo, Birger Møller-Pedersen
LCPC
1992
Springer
15 years 10 months ago
A Calculus of Gamma Programs
The Gamma model is a minimal programming language based on local multiset rewriting (with an elegant chemical reaction metaphor); Hankin et al derived a calculus of Gamma programs...
Chris Hankin, Daniel Le Métayer, David Sand...