Sciweavers

1710 search results - page 219 / 342
» High-Level Programs and Program Conditions
Sort
View
RTSS
1996
IEEE
15 years 11 months ago
A framework for implementing objects and scheduling tasks in lock-free real-time systems
We present an integrated framework for developing realtime systems in which lock-free algorithms are employed to implement shared objects. There are two key objectives of our work...
James H. Anderson, Srikanth Ramamurthy
DALT
2009
Springer
15 years 10 months ago
Ontology and Time Evolution of Obligations and Prohibitions Using Semantic Web Technology
The specification and monitoring of conditional obligations and prohibitions with starting points and deadlines is a crucial aspect in the design of open interaction systems. In th...
Nicoletta Fornara, Marco Colombetti
171
Voted
ISSTA
2010
ACM
15 years 7 months ago
Robust non-intrusive record-replay with processor extraction
With the advent of increasingly larger parallel machines, debugging is becoming more and more challenging. In particular, applications at this scale tend to behave non-determinist...
Filippo Gioachin, Gengbin Zheng, Laxmikant V. Kal&...
ENTCS
2008
91views more  ENTCS 2008»
15 years 6 months ago
Towards Concrete Syntax Patterns for Logic-based Transformation Rules
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
Malte Appeltauer, Günter Kniesel
CORR
2007
Springer
80views Education» more  CORR 2007»
15 years 6 months ago
Polygraphs for termination of left-linear term rewriting systems
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
Yves Guiraud