Sciweavers

284 search results - page 17 / 57
» Recursive Abstractions for Parameterized Systems
Sort
View
ICFP
2008
ACM
14 years 7 months ago
Mixin' up the ML module system
ML modules provide hierarchical namespace management, as well as fine-grained control over the propagation of type information, but they do not allow modules to be broken up into ...
Derek Dreyer, Andreas Rossberg
CSL
2007
Springer
14 years 1 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann
BIRTHDAY
2010
Springer
13 years 7 months ago
Programming Inductive Proofs - A New Approach Based on Contextual Types
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
Brigitte Pientka
INFORMATICALT
2000
99views more  INFORMATICALT 2000»
13 years 7 months ago
Closed-loop Robust Identification Using the Direct Approach
Abstract. The aim of the given paper is a development of the direct approach used for the estimation of parameters of a closed-loop discrete-time dynamic system in the case of addi...
Rimantas Pupeikis
ICALP
2000
Springer
13 years 11 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen