Sciweavers

3658 search results - page 649 / 732
» The logic of proofs, semantically
Sort
View
SLP
1994
121views more  SLP 1994»
13 years 9 months ago
CLP(Intervals) Revisited
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
Frédéric Benhamou, David A. McAllest...
GISCIENCE
2008
Springer
130views GIS» more  GISCIENCE 2008»
13 years 9 months ago
Road Networks and Their Incomplete Representation by Network Data Models
Road networks, roads, and junctions are examples of natural language terms whose semantics can be described by affordances of their physical referents. In order to define affordanc...
Simon Scheider, Werner Kuhn
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 8 months ago
A Non-Null Annotation Inferencer for Java Bytecode
We present a non-null annotations inferencer for the Java bytecode language. We previously proposed an analysis to infer non-null annotations and proved it soundness and completen...
Laurent Hubert
ENTCS
2010
130views more  ENTCS 2010»
13 years 8 months ago
Compositional System Security with Interface-Confined Adversaries
This paper presents a formal framework for compositional reasoning about secure systems. A key insight is to view a trusted system in terms of the interfaces that the various comp...
Deepak Garg, Jason Franklin, Dilsun Kirli Kaynar, ...
ENTCS
2008
97views more  ENTCS 2008»
13 years 8 months ago
Meta-programming With Built-in Type Equality
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
Tim Sheard, Emir Pasalic