Interactive Algorithms 2005

Gurevich, Yuri

doi:10.1007/11549345_3

Cited by 8 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…. The full theory of (ordinary) interactive algorithms is developed in [BG04a,BG04b]; overviews are given in [Gur05] and [RR05].…”

Section: Interactive Algorithmsmentioning

confidence: 99%

“…All algorithms in this paper are assumed to be small-step ordinary interactive algorithms in the sense of [BG04a,BG04b,Gur05].…”

Section: Interactive Algorithmsmentioning

confidence: 99%

“…Gurevich,A.Blass [Gur00,BG03,BG04a,BG04b,Gur05], and also B.Rossman and the authors [RR05]. The gist is that algorithms can be mathematically captured at their own native level of abstraction -ex.…”

Section: Introduction: Why Yet Another Formal Modelmentioning

confidence: 99%

“…Unlike the static abstract models, which necessarily invoke additional proof-theoretic devices to capture dynamic aspects, the behavioral theory explicitly targets the dynamic behavior of algorithms semantically. By recent work on behavioral theory [BG04a,BG04b,RR05,Gur05], this also includes interactive algorithms talking to an environment between steps, and within a step, allowing us to represent the abstract content of oracle algorithms and adversary games typical of computational cryptography directly. In the framework of intra-step interactive algorithms exact abstract representations of computational security notions, defined in terms of adversary games, emerge clearly.…”

Section: Introduction: Why Yet Another Formal Modelmentioning

confidence: 99%

See 3 more Smart Citations

Model–Based Testing of Cryptographic Protocols

Rosenzweig

Runje

Schulte

2005

Trustworthy Global Computing

View full text Add to dashboard Cite

Abstract. Modeling is a popular way of representing the behavior of a system. A very useful type of model in computing is an abstract state machine which describes transitions over first order structures. The general purpose model-based testing tool SpecExplorer (used within Microsoft, also available externally) uses such a model, written in AsmL or Spec#, to perform a search that checks that all reachable states of the model are safe, and also to check conformance of an arbitrary .NET implementation to the model. Spec Explorer provides a variety of ways to cut down the state space of the model, for instance by finitizing parameter domains or by providing predicate abstraction. It has already found subtle bugs in production software. First order structures and abstract state machines over them are also a useful way to think about cryptographic protocols, since models formulated in these terms arise by natural abstraction from computational cryptography. In this paper we explain this abstraction process, 'experiments as structures', and argue for its faithfulness. We show how the Dolev-Yao intruder model fits into SpecExplorer. In a word, the actions of the DolevYao intruder are the 'controllable' actions of the testing framework, whereas the actions of protocol participants are the 'observable' actions of the model. The unsafe states are the states violating say Lowe's security guarantees. Under this view, the general purpose software testing tool quickly finds known attacks, such as Lowe's attack on the NeedhamSchroeder protocol.

show abstract

“…. The full theory of (ordinary) interactive algorithms is developed in [BG04a,BG04b]; overviews are given in [Gur05] and [RR05].…”

Section: Interactive Algorithmsmentioning

confidence: 99%

“…All algorithms in this paper are assumed to be small-step ordinary interactive algorithms in the sense of [BG04a,BG04b,Gur05].…”

Section: Interactive Algorithmsmentioning

confidence: 99%

Section: Introduction: Why Yet Another Formal Modelmentioning

confidence: 99%

Section: Introduction: Why Yet Another Formal Modelmentioning

confidence: 99%

See 2 more Smart Citations

Model–Based Testing of Cryptographic Protocols

Rosenzweig

Runje

Schulte

2005

Trustworthy Global Computing

View full text Add to dashboard Cite

show abstract

“…ISs are unique in that they are "open" to the world and thus accept inputs and output results right throughout the operation of the system. They are felt to be so fraught with challenges that they have prompted research into the formulation of new types of algorithms [3]; extensions to the prevailing algorithmic paradigm [4]; a proposal for a new interactive paradigm for computation [4]; and even an urgent call for languages dedicated specifically to interaction [5].…”

Section: Introductionmentioning

confidence: 99%

Conceptual Modelling and Program Generation for Dynamic Interactive Systems

Powell

Akama

Wakatsuki

2008

2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies

View full text Add to dashboard Cite

Correct and efficient Dynamic Interactive Systems (DISs) are very difficult to conceptualize, model, implement, and maintain due to their dynamism and multiple concurrent interactive processes. As a result construction of DISs is time-consuming and implemented DISs are error-prone and difficult to comprehend and analyze. In this paper we describe an intuitive and systematic process by which models for DISs can be incrementally conceptualized from ideas or specifications and then used to generate concrete DIS programs in a target language/platform. The models constructed and the generated DIS programs are mathematically comprehensible; are amenable to Formal Methods; and can be reasoned about and rigorously analyzed.

show abstract

Can Abstract State Machines Be Useful in Language Theory?

Gurevich

Wallace

2006

Developments in Language Theory

View full text Add to dashboard Cite

Interactive Algorithms 2005

Cited by 8 publications

References 6 publications

Model–Based Testing of Cryptographic Protocols

Model–Based Testing of Cryptographic Protocols

Conceptual Modelling and Program Generation for Dynamic Interactive Systems

Can Abstract State Machines Be Useful in Language Theory?

Contact Info

Product

Resources

About