627 search results - page 71 / 126 » The Laplace-Jaynes approach to induction |
169
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for ...
165
click to vote
CSFW
2009
IEEE
16 years 29 days ago
2009
IEEE
We present a formal model for modeling and reasoning about security protocols. Our model extends standard, inductive, trace-based, symbolic approaches with a formalization of phys...
165
click to vote
TPHOL
2009
IEEE
16 years 25 days ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
161
click to vote
ISSTA
2009
ACM
16 years 21 days ago
2009
ACM
The aim of requirements-based testing is to generate test cases from a set of requirements for a given system or piece of software. In this paper we propose a formal semantics for...
173
click to vote
IFM
2007
Springer
16 years 10 days ago
2007
Springer
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...