Sciweavers

641 search results - page 94 / 129
» Embedding Finite Sets in a Logic Programming Language
Sort
View
SCAI
2001
13 years 9 months ago
Meaning and Partiality Revised
Muskens presents in Meaning and Partiality a semantics of possibly contradictory beliefs and other propositional attitudes. We propose a different partial logic based on a few key...
Jørgen Villadsen
POPL
2010
ACM
14 years 5 months ago
Dynamically Checking Ownership Policies in Concurrent C/C++ Programs
Concurrent programming errors arise when threads share data incorrectly. Programmers often avoid these errors by using synchronization to enforce a simple ownership policy: data i...
Jean-Phillipe Martin, Michael Hicks, Manuel Costa,...
PASTE
2004
ACM
14 years 1 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
ICALP
2007
Springer
14 years 2 months ago
Bounded Depth Data Trees
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
Henrik Björklund, Mikolaj Bojanczyk
VLSID
2008
IEEE
191views VLSI» more  VLSID 2008»
14 years 2 months ago
Programming and Performance Modelling of Automotive ECU Networks
The last decade has seen a phenomenal increase in the use of electronic components in automotive systems, resulting in the replacement of purely mechanical or hydraulic-implementa...
Samarjit Chakraborty, Sethu Ramesh