Sciweavers

1020 search results - page 121 / 204
» Tight Semantics for Logic Programs
Sort
View
PPDP
2007
Springer
15 years 6 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
POPL
2011
ACM
14 years 2 months ago
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol
We consider programs for embedded real-time systems which use priority-driven preemptive scheduling with task priorities adjusted dynamically according to the immediate ceiling pr...
Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Pe...
ICFP
2005
ACM
15 years 5 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
POPL
2008
ACM
16 years 5 days ago
A theory of platform-dependent low-level software
The C language definition leaves the sizes and layouts of types partially unspecified. When a C program makes assumptions about type layout, its semantics is defined only on platf...
Marius Nita, Dan Grossman, Craig Chambers
ATAL
2010
Springer
15 years 1 months ago
Formalizing organizational constraints: a semantic approach
An organizational modeling language can be used to specify an agent organization in terms of its roles, organizational structure, norms, etc. Such an organizational specification ...
M. Birna van Riemsdijk, Koen V. Hindriks, Catholij...