Results 1  10
of
52
Observational logic
 IN ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY (AMAST'98
, 1999
"... We present an institution of observational logic suited for statebased systems specifications. The institution is based on the notion of an observational signature (which incorporates the declaration of a distinguished set of observers) and on observational algebras whose operations are required ..."
Abstract

Cited by 60 (10 self)
 Add to MetaCart
We present an institution of observational logic suited for statebased systems specifications. The institution is based on the notion of an observational signature (which incorporates the declaration of a distinguished set of observers) and on observational algebras whose operations are required to be compatible with the indistinguishability relation determined by the given observers. In particular, we introduce a homomorphism concept for observational algebras which adequately expresses observational relationships between algebras. Then we consider a flexible notion of observational signature morphism which guarantees the satisfaction condition of institutions w.r.t. observational satisfaction of arbitrary firstorder sentences. From the proof theoretical point of view we construct a sound and complete proof system for the observational consequence relation. Then we consider structured observational specifications and we provide a sound and complete proof system for such specifications by using a general, institutionindependent result of [6].
Algebraiccoalgebraic specification in CoCasl
 J. LOGIC ALGEBRAIC PROGRAMMING
, 2006
"... We introduce CoCasl as a simple coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatypes and coalgebraic process types. We show that the wellknown coalgebraic modal logic can be expressed in CoCasl. We present sufficient criter ..."
Abstract

Cited by 26 (9 self)
 Add to MetaCart
(Show Context)
We introduce CoCasl as a simple coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatypes and coalgebraic process types. We show that the wellknown coalgebraic modal logic can be expressed in CoCasl. We present sufficient criteria for the existence of cofree models, also for several variants of nested cofree and free specifications. Moreover, we describe an extension of the existing proof support for Casl (in the shape of an encoding into higherorder logic) to CoCasl.
Generating optimal monitors for extended regular expressions
 In Proc. of the 3rd Workshop on Runtime Verification (RV’03), volume 89 of ENTCS
, 2003
"... Ordinary software engineers and programmers can easily understand regular patterns, as shown by the immense interest in and the success of scripting languages like Perl, based essentially on regular expression pattern matching. We believe that regular expressions provide an elegant and powerful spec ..."
Abstract

Cited by 22 (7 self)
 Add to MetaCart
(Show Context)
Ordinary software engineers and programmers can easily understand regular patterns, as shown by the immense interest in and the success of scripting languages like Perl, based essentially on regular expression pattern matching. We believe that regular expressions provide an elegant and powerful specification language also for monitoring requirements, because an execution trace of a program is in fact a string of states. Extended regular expressions (EREs) add complementation to regular expressions, which brings additional benefits by allowing one to specify patterns that must not occur during an execution. Complementation gives one the power to express patterns on strings more compactly. In this paper we present a technique to generate optimal monitors from EREs. Our monitors are deterministic finite automata (DFA) and our novel contribution is to generate them using a modern coalgebraic technique called coinduction. Based on experiments with our implementation, which can be publicly tested and used over the web, we believe that our technique is more efficient than the simplistic method based on complementation of automata which can quickly lead to a highlyexponential state explosion.
Formal design and verification of operational transformation algorithms for copies convergence
 Theoretical Computer Science
, 2005
"... algorithms for copies convergence ..."
(Show Context)
Conditional Circular Coinductive Rewriting with Case Analysis
, 2002
"... We argue for an algorithmic approach to behavioral proofs, review the hidden algebra approach, develop circular coinductive rewriting for conditional goals, extend it with case analysis, and give some examples. ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
(Show Context)
We argue for an algorithmic approach to behavioral proofs, review the hidden algebra approach, develop circular coinductive rewriting for conditional goals, extend it with case analysis, and give some examples.
CIRC : A Circular Coinductive Prover
 In CALCO, LNCS 4624
, 2007
"... Abstract. CIRC is an automated circular coinductive prover implemented as an extension of Maude. The circular coinductive technique that forms the core of CIRC is discussed, together with a highlevel implementation using metalevel capabilities of rewriting logic. To reflect the strength of CIRC i ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
(Show Context)
Abstract. CIRC is an automated circular coinductive prover implemented as an extension of Maude. The circular coinductive technique that forms the core of CIRC is discussed, together with a highlevel implementation using metalevel capabilities of rewriting logic. To reflect the strength of CIRC in automatically proving behavioral properties, an example defining and proving properties about infinite streams of infinite binary trees is shown. CIRC also provides limited support for automated inductive proving, which can be used in combination with coinduction. 1
Circular Coinduction
 In International Joint Conference on Automated Reasoning
, 2000
"... Circular coinduction is a technique for behavioral reasoning that extends cobasis coinduction to specifications with circularities. Because behavioral satisfaction is not recursively enumerable, no algorithm can work for every behavioral statement. However, algorithms using circular coinduction can ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
Circular coinduction is a technique for behavioral reasoning that extends cobasis coinduction to specifications with circularities. Because behavioral satisfaction is not recursively enumerable, no algorithm can work for every behavioral statement. However, algorithms using circular coinduction can prove every practical behavioral result that we know. This paper proves the correctness of circular coinduction and some consequences.
A Hidden Herbrand Theorem: Combining the Object and Logic Paradigms
 Principles of Declarative Programming
, 1998
"... : The benefits of the object, logic (or relational), functional, and constraint paradigms ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
(Show Context)
: The benefits of the object, logic (or relational), functional, and constraint paradigms
Webbased support for cooperative software engineering
 Annals of Software Engineering
, 2001
"... recent advances in web technology, interface design, and specification. Our effort to improve the usability of such systems has led us into algebraic semiotics, while our effort to develop better formal methods for distributed concurrent systems has led us into hidden algebra and fuzzy logic. This p ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
(Show Context)
recent advances in web technology, interface design, and specification. Our effort to improve the usability of such systems has led us into algebraic semiotics, while our effort to develop better formal methods for distributed concurrent systems has led us into hidden algebra and fuzzy logic. This paper discusses the Tatami system design, especially its software architecture, and its user interface principles. New work in the latter area includes an extension of algebraic semiotics to dynamic multimedia interfaces, and integrating Gibsonian affordances with algebraic semiotics. 1
Musical Qualia, Context, Time, and Emotion
 Journal of Consciousness Studies
, 2004
"... Nearly all listeners consider the subjective aspects of music, such as its emotional tone, to have primary importance. But contemporary philosophers often downplay, ignore, or even deny such aspects of experience. Moreover, traditional philosophies of music try to decontextualize it. Using music ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
Nearly all listeners consider the subjective aspects of music, such as its emotional tone, to have primary importance. But contemporary philosophers often downplay, ignore, or even deny such aspects of experience. Moreover, traditional philosophies of music try to decontextualize it. Using music as an example, this paper explores the structure of qualitative experience, demonstrating that it is multilayer emergent, noncompositional, enacted, and situation dependent, among other nonCartesian properties.