Sciweavers

2604 search results - page 164 / 521
» General constant expressions for system programming language...
Sort
View
CORR
2009
Springer
115views Education» more  CORR 2009»
13 years 7 months ago
Testing the Equivalence of Regular Languages
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
Marco Almeida, Nelma Moreira, Rogério Reis
ALC
1997
13 years 10 months ago
Synthesising interconnections
In the context of the modular and incremental development of complex systems, viewed as interconnections of interacting components, new dimensions and new problems arise in the ca...
José Luiz Fiadeiro, Antónia Lopes, T...
SIGCOMM
2003
ACM
14 years 2 months ago
A high-level programming environment for packet trace anonymization and transformation
Packet traces of operational Internet traffic are invaluable to network research, but public sharing of such traces is severely limited by the need to first remove all sensitive...
Ruoming Pang, Vern Paxson
PPDP
2010
Springer
13 years 7 months ago
Permissive-nominal logic
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
Gilles Dowek, Murdoch James Gabbay
ICLP
1994
Springer
14 years 1 months ago
Compiling Intensional Sets in CLP
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
Paola Bruscoli, Agostino Dovier, Enrico Pontelli, ...