Demo Data from EDBT 2026 / reviewers in the wild / expert
Ed Brinksma
dblp:b/EdBrinksma
· DBLP profile ↗
30ranked-venue papers
16as first author
0since 2021 · last 2008
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 16 · 9 first-authorTheory of computation · 11 · 5 first-authorComputer networks · 7 · 6 first-authorSystems, architecture and hardware · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
3 papers |
Automata and formal languages · 50% Automated reasoning and model checking · 25% Logic in computer science · 25% | |
| Software engineering, system software, and programming languages
2 papers |
Software testing · 64% Compilers and program optimization · 28% Requirements engineering and software design · 8% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Embedded and real-time systems · 77% Performance modeling and evaluation · 23% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages › timed automata
priced timed automata |
0.0 | 1 | 2001 | As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata · CAV 2001 |
Automated reasoning and model checking
reachability |
0.0 | 1 | 2001 | As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata · CAV 2001 |
Automata and formal languages
timed automata |
0.0 | 1 | 2001 | As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata · CAV 2001 |
Software testing › specification-based testing
conformance testing |
0.0 | 1 | 1999 | Formal Methods for Conformance Testing: Theory Can Be Practical · CAV 1999 |
Embedded and real-time systems
soft real-time systems |
0.0 | 1 | 1999 | Specification and Analysis of Soft Real-Time Systems: Quantity and Quality · RTSS 1999 |
Logic in computer science
process algebra |
0.0 | 1 | 1999 | A Complete Finite Prefix for Process Algebra · CAV 1999 |
Compilers and program optimization › program transformation
semantics-preserving transformation |
0.0 | 1 | 1993 | Functionality Decomposition by Compositional Correstness Preserving Transformation · CAV 1993 |
Performance modeling and evaluation › simulation
discrete-event simulation |
0.0 | 1 | 1999 | Specification and Analysis of Soft Real-Time Systems: Quantity and Quality · RTSS 1999 |
Logic in computer science
formal methods |
0.0 | 1 | 1999 | Formal Methods for Conformance Testing: Theory Can Be Practical · CAV 1999 |
Methods — techniques the papers use, named apart from their topics
process algebra · 0.0formal methods · 0.0priced timed automata · 0.0stochastic automata · 0.0reachability analysis · 0.0discrete-event simulation · 0.0compositional correctness-preserving transformation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Dependability for high-tech systems: an industry-as-laboratory approachabstractThe dependability of high-volume embedded systems, such a consumer electronic devices, is threatened by a combination of quickly increasing complexity, decreasing\ntime-to-market, and strong cost constraints. This poses challenging research questions that are investigated in the Trader project, following the industry-as-lab approach. We\npresent the main vision of this project, which is based on a model-based control paradigm, and the current status of the project results. Ed Brinksma, Jozef Hooman |
DATE | 1 |
| 2008 | Optimal infinite scheduling for multi-priced timed automata
Patricia Bouyer, Ed Brinksma, Kim G. Larsen |
Formal Methods Syst. Des. | 2 |
| 2006 | A Semantic Framework for Test Coverage
Laura Brandán Briones, Ed Brinksma, Mariëlle Stoelinga |
ATVA | 2 |
| 2005 | Modelling mobile health systems: an application of augmented MDA for the extended healthcare enterpriseabstractMobile health systems can extend the enterprise computing system of the healthcare provider by bringing services to the patient any time and anywhere. We propose a model-driven design and development methodology for the development of the m-health components in such extended enterprise computing systems. The methodology applies a model-driven design and development approach augmented with formal validation and verification to address quality and correctness and to support model transformation. Work on modelling applications from the healthcare domain is reported. One objective of this work is to explore and elaborate the proposed methodology. At the University of Twente we are developing m-health systems based on body area networks (BANs). One specialization of the generic BAN is the health BAN, which incorporates a set of devices and associated software components to provide some set of health-related services. A patient has a personalized instance of the health BAN customized to their current set of needs. A health professional interacts with their patients' BANs via a BAN professional system. The set of deployed BANs are supported by a server. We refer to this distributed system as the BAN System. The BAN system extends the enterprise computing system of the healthcare provider. Development of such systems requires a sound software engineering approach and this is what we explore with the new methodology. The methodology is illustrated with reference to modelling activities targeted at real implementations. In the context of the awareness project BAN implementations are tested in a number of clinical settings including epilepsy management and management of chronic pain. Val Jones 0001, Arend Rensink, Ed Brinksma |
EDOC | 3 |
| 2005 | Testing Real-Time Multi Input-Output Systems
Laura Brandán Briones, Ed Brinksma |
ICFEM | 2 |
| 2003 | Managing the verification trajectory
Theo C. Ruys, Ed Brinksma |
Int. J. Softw. Tools Technol. Transf. | 2 |
| 2002 | Verification and optimization of a PLC control schedule
Ed Brinksma, Angelika Mader, Ansgar Fehnker |
Int. J. Softw. Tools Technol. Transf. | 1 |
| 2001 | As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
Kim G. Larsen, Gerd Behrmann, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Paul Pettersson, Judi Romijn |
CAV | 3 |
| 2001 | Verification is experimentation!
Ed Brinksma |
Int. J. Softw. Tools Technol. Transf. | 1 |
| 2000 | Verification Is Experimentation!
Ed Brinksma |
CONCUR | 1 |
| 2000 | Guest Editors' Introduction: Formal Methods for Object Oriented Distributed SystemsabstractObject-based distributed computing is now a well established technique for constructing large, heterogeneous computing and telecommunications systems. Indeed, standards bodies and consortia such as, ITU, ISO, OMG, TINA-C, etc., have all defined distributed object-based frameworks as a foundation for open distributed computing. Howard Bowman, John Derrick, Ed Brinksma |
IEEE Trans. Software Eng. | 3 |
| 1999 | Formal Methods for Conformance Testing: Theory Can Be Practical
Ed Brinksma |
CAV | 1 |
| 1999 | A Complete Finite Prefix for Process Algebra
Rom Langerak, Ed Brinksma |
CAV | 2 |
| 1999 | Specification and Analysis of Soft Real-Time Systems: Quantity and QualityabstractThis paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arbitrary probability distributions to express delays of activities. The semantics of this process algebra is given in terms of stochastic automata, a variant of timed automata where clocks are initialised randomly and run backwards. To analyse quantitative properties, an algorithm is presented for the on-the-fly generation of a discrete-event simulation model from a process algebra specification. On the qualitative side, a symbolic technique for classical reachability analysis of stochastic automata is presented. As a result a unifying framework for the specification and analysis of quantitative and qualitative properties is obtained. We discuss an implementation of both analytic methods and specify and analyse a fault-tolerant multi-processor system. Pedro R. D'Argenio, Joost-Pieter Katoen, Ed Brinksma |
RTSS | 3 |
| 1999 | Cache Consistency by Design
Ed Brinksma |
Distributed Comput. | 1 |
| 1998 | Experience with Literate Programming in the Modelling and Validation of Systems
Theo C. Ruys, Ed Brinksma |
TACAS | 2 |
| 1998 | Partial Order Models for Quantitative Extensions of LOTOS
Ed Brinksma, Joost-Pieter Katoen, Rom Langerak, Diego Latella |
Comput. Networks | 1 |
| 1998 | A Consistent Causality-Based View on a Timed Process Algebra Including Urgent Interactions
Joost-Pieter Katoen, Rom Langerak, Ed Brinksma, Diego Latella, Tommaso Bolognesi |
Formal Methods Syst. Des. | 3 |
| 1997 | Causal Ambiguity and Partial Orders in Event Structures
Rom Langerak, Ed Brinksma, Joost-Pieter Katoen |
CONCUR | 2 |
| 1996 | Using Formal Methods: if you're so smart how come you ain't rich?
Ed Brinksma |
FORTE | 1 |
| 1996 | Applications of Fair Testing
Ed Brinksma, Arend Rensink, Walter Vogler |
FORTE | 1 |
| 1995 | Fair Testing
Ed Brinksma, Arend Rensink, Walter Vogler |
CONCUR | 1 |
| 1995 | A Stochastic Causality-Based Process AlgebraabstractThis paper discusses stochastic extensions of a simple process algebra in a causality-based setting. Atomic actions are supposed to happen after a delay that is determined by a stochastic variable with a certain distribution. A simple stochastic type of event structures is discussed, restricting the distribution functions to be exponential. A corresponding operational semantics of this model is given and compared to existing (interleaved) approaches. Secondly, a stochastic variant of event structures is discussed where distributions are of a much more general nature, viz. of phase-type. This includes exponential, Erlang, Coxian and mixtures of exponential distributions. Ed Brinksma, Joost-Pieter Katoen, Rom Langerak, Diego Latella |
Comput. J. | 1 |
| 1993 | Functionality Decomposition by Compositional Correstness Preserving Transformation
Ed Brinksma, Rom Langerak, Peter Broekroelofs |
CAV | 1 |
| 1992 | On the Uniqueness of Fixpoints Modulo Observation Congruence
Ed Brinksma |
CONCUR | 1 |
| 1991 | What is the Method in Formal Methods?
Ed Brinksma |
FORTE | 1 |
| 1991 | Introduction to the PSTV-IX
Ed Brinksma, Giuseppe Scollo, Chris A. Vissers |
Comput. Networks ISDN Syst. | 1 |
| 1991 | Specification Styles in Distributed Systems Design and Verification
Chris A. Vissers, Giuseppe Scollo, Marten van Sinderen, Ed Brinksma |
Theor. Comput. Sci. | 4 |
| 1989 | Specification Modules in LOTOS
Ed Brinksma |
FORTE | 1 |
| 1987 | Introduction to the ISO Specification Language LOTOS
Tommaso Bolognesi, Ed Brinksma |
Comput. Networks | 2 |