Sciweavers

564 search results - page 82 / 113
» Dependent types and program equivalence
Sort
View
SI3D
2009
ACM
14 years 3 months ago
Approximating dynamic global illumination in image space
Physically plausible illumination at real-time framerates is often achieved using approximations. One popular example is ambient occlusion (AO), for which very simple and efficie...
Tobias Ritschel, Thorsten Grosch, Hans-Peter Seide...
AI
2007
Springer
13 years 9 months ago
Anyone but him: The complexity of precluding an alternative
Preference aggregation in a multiagent setting is a central issue in both human and computer contexts. In this paper, we study in terms of complexity the vulnerability of preferen...
Edith Hemaspaandra, Lane A. Hemaspaandra, Jör...
SAC
2006
ACM
13 years 9 months ago
Transforming OCL constraints: a context change approach
Integrity constraints (ICs) play a key role in the definition of conceptual schemas. In the UML, ICs are usually specified as invariants written in the OCL. However, due to the hi...
Jordi Cabot, Ernest Teniente
ESOP
2004
Springer
14 years 2 months ago
Extracting a Data Flow Analyser in Constructive Logic
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
David Cachera, Thomas P. Jensen, David Pichardie, ...
ICLP
2005
Springer
14 years 2 months ago
Small Proof Witnesses for LF
Abstract. We instrument a higher-order logic programming search procedure to generate and check small proof witnesses for the Twelf system, an implementation of the logical framewo...
Susmit Sarkar, Brigitte Pientka, Karl Crary