Search

Your search keyword '"de Boer, F. S."' showing total 44 results
Start Over Author "de Boer, F. S."

Refine your results

more »

more »

44 results on '"de Boer, F. S."'

1. Proving correctness of Timed Concurrent Constraint Programs

Author

de Boer, F. S., Gabbrielli, M., and Meo, M. C.

Subjects
Computer Science - Logic in Computer Science, Computer Science - Programming Languages, F.3.1, D.3.1, D.3.2
Abstract

A temporal logic is presented for reasoning about the correctness of timed concurrent constraint programs. The logic is based on modalities which allow one to specify what a process produces as a reaction to what its environment inputs. These modalities provide an assumption/commitment style of specification which allows a sound and complete compositional axiomatization of the reactive behavior of timed concurrent constraint programs.

Published
2002

2. Agent Programming with Declarative Goals

Author

de Boer, F. S., Hindriks, K. V., van der Hoek, W., and Meyer, J. -J. Ch.

Subjects
Computer Science - Artificial Intelligence, Computer Science - Programming Languages, F.3.1, F.3.2, I.2.5, I.2.4
Abstract

A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a link between agent logics and agent programming frameworks is identified and explained by the fact that agent programming frameworks have not incorporated the concept of a `declarative goal'. Instead, such frameworks have focused mainly on plans or `goals-to-do' instead of the end goals to be realised which are also called `goals-to-be'. In this paper, a new programming language called GOAL is introduced which incorporates such declarative goals. The notion of a `commitment strategy' - one of the main theoretical insights due to agent logics, which explains the relation between beliefs and goals - is used to construct a computational semantics for GOAL. Finally, a proof theory for proving properties of GOAL agents is introduced. Thus, we offer a complete theory of agent programming in the sense that our theory provides both for a programming framework and a programming logic for such agents. An example program is proven correct by using this programming logic.

Published
2002

3. Monitoring Method Call Sequences Using Annotations

Author

Nobakht, B., Bonsangue, M. M., de Boer, F. S., de Gouw, S., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Barbosa, Luís Soares, editor, and Lumpe, Markus, editor

Published
2012
Full Text
View/download PDF

4. Reasoning about Recursive Processes in Shared-Variable Concurrency

Author

de Boer, F. S., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Dams, Dennis, editor, Hannemann, Ulrich, editor, and Steffen, Martin, editor

Published
2010
Full Text
View/download PDF

5. Using XML Transformations for Enterprise Architectures

Author

Stam, A., Jacob, J., de Boer, F. S., Bonsangue, M. M., van der Torre, L., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Margaria, Tiziana, editor

Published
2006
Full Text
View/download PDF

6. A Fully Abstract Semantics for UML Components

Author

de Boer, F. S., Bonsangue, M. M., Steffen, M., Ábrahám, E., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, de Boer, Frank S., editor, Bonsangue, Marcello M., editor, Graf, Susanne, editor, and de Roever, Willem-Paul, editor

Published
2005
Full Text
View/download PDF

10. A WP-calculus for OO

Author

de Boer, F. S, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, and Thomas, Wolfgang, editor

Published
1999
Full Text
View/download PDF

28. A proof system for the parallel object-oriented language POOL

Author

de Boer, F. S., Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, and Paterson, Michael S., editor

Published
1990
Full Text
View/download PDF

39. Compositionality in the temporal logic of concurrent systems

Author

de Boer, F. S., Goos, G., editor, Hartmanis, J., editor, Barstow, D., editor, Brauer, W., editor, Brinch Hansen, P., editor, Gries, D., editor, Luckham, D., editor, Moler, C., editor, Pnueli, A., editor, Seegmüller, G., editor, Stoer, J., editor, Wirth, N., editor, Odijk, Eddy, editor, Rem, Martin, editor, and Syre, Jean-Claude, editor

Published
1989
Full Text
View/download PDF

40. Editorial

Author

de Boer, F. S., Olderog, E. -R., Ponse, A., and de Vries, F. -J.

Published
1994
Full Text
View/download PDF

41. Integrating Architectural Models

Author

Arbab, Farhad, de Boer, F. S., Bonsangue, M., Lankhorst, M. M., Proper, H. A., van der Torre, Leon, Arbab, Farhad, de Boer, F. S., Bonsangue, M., Lankhorst, M. M., Proper, H. A., and van der Torre, Leon

Abstract

The diversity of architectural models in enterprise architecture is a problem for their integration. In this paper we distinguish three kinds of models from each other and their visualization, and we illustrate how the distinctions can be used for model integration within the architectural approach. Symbolic models express properties of architectures of systems, semantic models interpret the symbols of semantic models, and subjective models are purposely abstracted conceptions of a domain. Building on results obtained in the ArchiMate project, we illustrate how symbolic models can be integrated using an architectural language, how integrated models can be updated using the distinction between symbolic models and their visualization, and how semantic models can be integrated using a new kind of enterprise analysis called semantic analysis. We also suggest that subjective models can be integrated using techniques from natural language analysis

Published
2007

43. The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating Processes.

Author

Goos, Gerhard, Hartmanis, Juris, van Leeuwen, Jan, Kutyłowski, Mirosław, Pacholski, Leszek, Wierzbicki, Tomasz, de Boer, F. S., de Roever, W. -P., and Hannemann, U.

Abstract

We investigate the semantic foundations of a compositional proof method for concurrent systems communicating via synchronous message passing. Basing ourselves on the inductive assertion method for local verification of synchronous transition diagrams which are composed both sequentially and in parallel, we present a compositional proof system that is proved sound and (semantically) complete. The mathematical foundations of this methodology consist of a purely semantic view of predicates as sets of states, the introduction of a virtual history variable into the proofs of basic components, a semantic approximation called involvement of the syntactic notion of occurrence of a variable or a channel within an assertion, and the use of projections as fundamental technique for formulating compositional proof rules. [ABSTRACT FROM AUTHOR]

Published
1999
Full Text
View/download PDF

44. A Timed Concurrent Constraint Language

Author

de Boer, F. S., Gabbrielli, M., and Meo, M. C.

Abstract

We study a timed concurrent constraint language, called tccp, which is obtained by a natural timed interpretation of the usual ccp constructs: action-prefixing is interpreted as the next-time operator and the parallel execution of agents follows the scheduling policy of maximal parallelism. Additionally, tccp includes a simple primitive which allows one to specify timing constraints. We define the operational semantics of tccp by means of a transition system and we define a denotational model which is fully abstract with respect to the usual notion of observables (that is, the results of terminating computations). Moreover, we study the semantics and expressive power of the notion of maximal parallelism underlying the computational model of tccp: We define a fully abstract semantics for a sublanguage of tccp, called ccpm, which essentially is concurrent constraint programming, provided that we interpret the parallel operator in terms of maximal parallelism rather than of interleaving. We show that tccp is strictly more expressive than ccpm which, in its turn, is strictly more expressive than ccp.

Published
2000
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results