Sciweavers

3053 search results - page 438 / 611
» A Logic of Abstract Argumentation
Sort
View
ALIFE
2008
13 years 9 months ago
Natural Selection in Relation to Complexity
, reproductive value, soft selectionAbstract Structural complexity characterizes our representations of dissipative structures. As a mechanistic concept, when referred to natural s...
Stanley N. Salthe
FUIN
2007
110views more  FUIN 2007»
13 years 9 months ago
Controllable Delay-Insensitive Processes
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
Mark B. Josephs, Hemangee K. Kapoor
ENTCS
2002
143views more  ENTCS 2002»
13 years 9 months ago
Collecting Statistics over Runtime Executions
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
Bernd Finkbeiner, Sriram Sankaranarayanan, Henny S...
CSUR
1999
137views more  CSUR 1999»
13 years 9 months ago
Algebraic Methods for Specification and Formal Development of Programs
with functions over those sets. This level of abstraction is commensurate with the view that the correctness of the input/output behaviour of a program takes precedence over all it...
Donald Sannella, Andrzej Tarlecki
TCAD
2002
145views more  TCAD 2002»
13 years 9 months ago
Automatic generation of synthetic sequential benchmark circuits
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil