Sciweavers

123 search results - page 17 / 25
» On the Construction of Sorted Reactive Systems
Sort
View
APAL
2005
107views more  APAL 2005»
13 years 7 months ago
Uniform Heyting arithmetic
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
Ulrich Berger
ICFP
2010
ACM
13 years 7 months ago
ReCaml: execution state as the cornerstone of reconfigurations
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
Jérémy Buisson, Fabien Dagnat
RSP
2007
IEEE
139views Control Systems» more  RSP 2007»
14 years 1 months ago
Verifying Distributed Protocols using MSC-Assertions, Run-time Monitoring, and Automatic Test Generation
This paper addresses the need for formal specification and runtime verification of system-level requirements of distributed reactive systems. It describes a formalism for specifyi...
Doron Drusinsky, Man-tak Shing
KES
2008
Springer
13 years 7 months ago
Instruction-based development: From evolution to generic structures of digital circuits
Evolutionary techniques provide powerful tools to design novel solutions for hard problems in different areas. However, the problem of scale (i.e. how to create a large, complex s...
Michal Bidlo, Jaroslav Skarvada
CIKM
2008
Springer
13 years 9 months ago
Learning the distance metric in a personal ontology
Personal ontology construction is the task of sorting through relevant materials, identifying the main topics and concepts, and organizing them to suit personal needs. Automatic c...
Hui Yang, Jamie Callan