Sciweavers

691 search results - page 14 / 139
» Equational Abstractions
Sort
View
IFL
2003
Springer
159views Formal Methods» more  IFL 2003»
14 years 1 months ago
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
Pedro B. Vasconcelos, Kevin Hammond
ITP
2010
172views Mathematics» more  ITP 2010»
14 years 18 days ago
Equations: A Dependent Pattern-Matching Compiler
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
Matthieu Sozeau
HYBRID
2007
Springer
14 years 18 days ago
Viability-Based Computations of Solutions to the Hamilton-Jacobi-Bellman Equation
Abstract. This article proposes a new capture basin algorithm for computing the numerical solution of a class of Hamilton-Jacobi-Bellman (HJB) partial differential equations (PDEs)...
Alexandre M. Bayen, Christian G. Claudel, Patrick ...
CL
2000
Springer
13 years 8 months ago
A New Equational Foundation for the Fluent Calculus
Abstract. A new equational foundation is presented for the Fluent Calculus, an established predicate calculus formalism for reasoning about actions. We discuss limitations of the e...
Hans-Peter Störr, Michael Thielscher
CSFW
2005
IEEE
14 years 2 months ago
Deciding Knowledge in Security Protocols under (Many More) Equational Theories
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...
Martín Abadi, Véronique Cortier