Sciweavers

677 search results - page 30 / 136
» Dependent Types from Counterexamples
Sort
View
ECSA
2010
Springer
14 years 10 months ago
Learning from the Cell Life-Cycle: A Self-adaptive Paradigm
In the software domain, self-adaptive systems are able to modify their behavior at run-time to respond to changes in the environment they run, to changes of the users' require...
Antinisca Di Marco, Francesco Gallo, Paola Inverar...
POPL
1993
ACM
15 years 1 months ago
Formal Parametric Polymorphism
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typ...
Martín Abadi, Luca Cardelli, Pierre-Louis C...
EAAI
2007
93views more  EAAI 2007»
14 years 9 months ago
Mining Pareto-optimal rules with respect to support and confirmation or support and anti-support
: In knowledge discovery and data mining many measures of interestingness have been proposed in order to measure the relevance and utility of the discovered patterns. Among these m...
Izabela Brzezinska, Salvatore Greco, Roman Slowins...
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
14 years 7 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
74
Voted
EACL
1993
ACL Anthology
14 years 11 months ago
New Frontiers Beyond Context-Freeness: DI-Grammars And DI-Automata
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class - the DI-grammars - cover unbound de...
Peter Staudacher