Sciweavers

8132 search results - page 300 / 1627
» Dependability, Abstraction, and Programming
Sort
View
AI
2009
Springer
15 years 10 months ago
Executable Specifications of Fully General Attribute Grammars with Ambiguity and Left-Recursion
Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute depend...
Rahmatullah Hafiz
SAS
2005
Springer
162views Formal Methods» more  SAS 2005»
16 years 6 days ago
Boolean Heaps
We show that the idea of predicates on heap objects can be cast in the framework of predicate abstraction. This leads to an alternative view on the underlying concepts of three-val...
Andreas Podelski, Thomas Wies
DAGSTUHL
2003
15 years 8 months ago
Organising Computation through Dynamic Grouping
Abstract. There are a range of abstractions used for both modelling and proof modern computational systems. While these abstractions may have been devised for specific purposes, t...
Michael Fisher, Chiara Ghidini, Benjamin Hirsch
152
Voted
PERCOM
2009
ACM
16 years 7 months ago
Multi-Event Handlers for Sensor-Driven Ubiquitous Computing Applications
Abstract--We propose an extension to the event-based programming model for sensor-driven ubiquitous computing applications. The extension consists of three abstractions: MultiEvent...
Sean Reilly
ICLP
2009
Springer
16 years 7 months ago
Qualified Computations in Functional Logic Programming
Abstract. Qualification has been recently introduced as a generalization of uncertainty in the field of Logic Programming. In this paper we investigate a more expressive language f...
Rafael Caballero, Mario Rodríguez-Artalejo,...