Sciweavers

2035 search results - page 150 / 407
» On the complexity of stratified logics
Sort
View
MKM
2009
Springer
16 years 29 days ago
A Logically Saturated Extension of
This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Autexier [4] on ¯λµ˜µ, a calculus introduced by Curien and Herbelin [5,6]. Jus...
Lionel Elie Mamane, Herman Geuvers, James McKinna
ATVA
2007
Springer
108views Hardware» more  ATVA 2007»
16 years 18 days ago
A New Approach to Bounded Model Checking for Branching Time Logics
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
Rotem Oshman, Orna Grumberg
ISPA
2007
Springer
16 years 16 days ago
Binomial Graph: A Scalable and Fault-Tolerant Logical Network Topology
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
Thara Angskun, George Bosilca, Jack Dongarra
ISCC
2006
IEEE
202views Communications» more  ISCC 2006»
16 years 13 days ago
Fuzzy Logic Congestion Control in TCP/IP Tandem Networks
Network resource management and control is a complex problem that requires robust, possibly intelligent, control methodologies to obtain satisfactory performance. While many Activ...
Chrysostomos Chrysostomou, Andreas Pitsillides
JELIA
2004
Springer
15 years 11 months ago
Towards a Logical Analysis of Biochemical Pathways
Biochemical pathways or networks are generic representations used to model many different types of complex functional and physical interactions in biological systems. Models based ...
Patrick Doherty, Steve Kertes, Martin Magnusson, A...