Sciweavers

815 search results - page 130 / 163
» Algebraic Recognizability of Languages
Sort
View
ENTCS
2008
121views more  ENTCS 2008»
14 years 12 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
FUIN
2007
92views more  FUIN 2007»
14 years 11 months ago
Foundations of Modal Deductive Databases
We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algor...
Linh Anh Nguyen
IJFCS
2007
93views more  IJFCS 2007»
14 years 11 months ago
Modelling and Analysis of PKI-Based Systems Using Process Calculi
In this technical report, we present a process algebra aimed at modelling PKI-based systems. The new language, SPIKY, extends the spi-calculus by adding primitives for the retriev...
Benjamin Aziz, Geoff Hamilton
JANCL
2002
91views more  JANCL 2002»
14 years 11 months ago
A Modal Walk Through Space
We investigate the major mathematical theories of space from a modal standpoint: topology, affine geometry, metric geometry, and vector algebra. This allows us to see new fine-str...
Marco Aiello, Johan van Benthem
TCS
2002
14 years 11 months ago
A formal approach to object-oriented software engineering
We show how formal specifications can be integrated into one of the current pragmatic object-oriented software development methods. Jacobson's "Object-Oriented Software ...
Martin Wirsing, Alexander Knapp