Sciweavers

6274 search results - page 61 / 1255
» Proofs, Programs, Processes
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 10 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
AMAI
1999
Springer
13 years 9 months ago
From Logic Programming Towards Multi-Agent Systems
In this paper we present an extension of logic programming (LP) that is suitable not only for the "rational" component of a single agent but also for the "reactive&...
Robert A. Kowalski, Fariba Sadri
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 months ago
A Proof Carrying Code Framework for Inlined Reference Monitors in Java Bytecode
We propose a lightweight approach for certification of Java bytecode monitor inlining using proof-carrying code. The main purpose of such a framework is to enable development use ...
Mads Dam, Andreas Lundblad
PEPM
2010
ACM
14 years 1 days ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
FROCOS
2005
Springer
14 years 3 months ago
ATS: A Language That Combines Programming with Theorem Proving
ATS is a language with a highly expressive type system that supports a restricted form of dependent types in which programs are not allowed to appear in type expressions. The langu...
Sa Cui, Kevin Donnelly, Hongwei Xi