Sciweavers

1948 search results - page 114 / 390
» Formalizing Mirror Theory
Sort
View
160
Voted
EUROMICRO
1996
IEEE
15 years 9 months ago
A Graph Rewriting Approach for Transformational Design of Digital Systems
Transformational design integrates design and verification. It combines "correctness by construciion" and design creativity by the use ofpre-proven behaviour preserving ...
Corrie Huijs
TAPSOFT
1997
Springer
15 years 9 months ago
Traces of I/O-Automata in Isabelle/HOLCF
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
Olaf Müller, Tobias Nipkow
159
Voted
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
15 years 4 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers
FORMATS
2010
Springer
15 years 3 months ago
Natural Domain SMT: A Preliminary Assessment
SMT solvers have traditionally been based on the DPLL(T) algorithm, where the driving force behind the procedure is a DPLL search over truth valuations. This traditional framework ...
Scott Cotton
ESORICS
2006
Springer
15 years 9 months ago
Towards an Information-Theoretic Framework for Analyzing Intrusion Detection Systems
IDS research still needs to strengthen mathematical foundations and theoretic guidelines. In this paper, we build a formal framework, based on information theory, for analyzing and...
Guofei Gu, Prahlad Fogla, David Dagon, Wenke Lee, ...