Sciweavers

1864 search results - page 125 / 373
» Formal topology and domains
Sort
View
RWEB
2010
Springer
15 years 4 months ago
Model Driven Engineering with Ontology Technologies
Ontologies constitute formal models of some aspect of the world that may be used for drawing interesting logical conclusions even for large models. Software models capture relevant...
Steffen Staab, Tobias Walter, Gerd Gröner, Fe...
FM
2011
Springer
357views Formal Methods» more  FM 2011»
14 years 10 months ago
TraceContract: A Scala DSL for Trace Analysis
Abstract. In this paper we describe TRACECONTRACT, an API for trace analysis, implemented in the SCALA programming language. We argue that for certain forms of trace analysis the b...
Howard Barringer, Klaus Havelund
CORR
2008
Springer
73views Education» more  CORR 2008»
15 years 6 months ago
RF-MEMS Switched Varactors for Medium Power Applications
In RF (Radio Frequency) domain, one of the limitations of using MEMS (Micro Electromechanical Systems) switching devices for medium power applications is RF power. Failure phenomen...
F. Maury, Arnaud Pothier, A. Crunteanu, F. Conseil...
TCS
2008
15 years 6 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
SAS
2007
Springer
16 years 16 days ago
Program Analysis Using Symbolic Ranges
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gup...