DROPS

Found 2 Possible Name Variants:

Ábrahám, Erika
Abraham, Erika

Ábrahám, Erika

Document

DOI: 10.4230/DagRep.13.1.155

Integrated Rigorous Analysis in Cyber-Physical Systems Engineering (Dagstuhl Seminar 23041)

Authors: Erika Abraham, Stefan Hallerstede, John Hatcliff, Danielle Stewart, and Noah Abou El Wafa

Published in: Dagstuhl Reports, Volume 13, Issue 1 (2023)

Abstract

This report documents the program and the outcomes of the Dagstuhl Seminar 23041 "Integrated Rigorous Analysis in Cyber-Physical Systems (CPS) Engineering". This seminar brought together academic and industry representations from a variety of domains with backgrounds in different techniques to develop a roadmap for addressing the current challenges in the area of CPS engineering. An overarching theme was the potential use of integrated models and associated methodologies that support cross-technique information/results sharing and smooth workflow hand-offs between individual tools and methods.

Cite as

Erika Abraham, Stefan Hallerstede, John Hatcliff, Danielle Stewart, and Noah Abou El Wafa. Integrated Rigorous Analysis in Cyber-Physical Systems Engineering (Dagstuhl Seminar 23041). In Dagstuhl Reports, Volume 13, Issue 1, pp. 155-183, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{abraham_et_al:DagRep.13.1.155,
  author =	{Abraham, Erika and Hallerstede, Stefan and Hatcliff, John and Stewart, Danielle and Wafa, Noah Abou El},
  title =	{{Integrated Rigorous Analysis in Cyber-Physical Systems Engineering (Dagstuhl Seminar 23041)}},
  pages =	{155--183},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{1},
  editor =	{Abraham, Erika and Hallerstede, Stefan and Hatcliff, John and Stewart, Danielle and Wafa, Noah Abou El},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.1.155},
  URN =		{urn:nbn:de:0030-drops-191209},
  doi =		{10.4230/DagRep.13.1.155},
  annote =	{Keywords: cyber-physical systems, formal methods, rigorous modelling and analysis, systems engineering}
}

Document

DOI: 10.4230/DagRep.12.2.67

New Perspectives in Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 22072)

Authors: Erika Abraham, James H. Davenport, Matthew England, and Alberto Griggio

Published in: Dagstuhl Reports, Volume 12, Issue 2 (2022)

Abstract

Dagstuhl Seminar 22072 gathered researchers from Symbolic Computation and Satisfiability Checking. These communities have independent histories but worked together in recent years (e.g. Dagstuhl Seminar 15471 and the EU SC-Square Project). We seek to tackle problems which are in the interest of both communities, and require the expertise of both to overcome.

Cite as

Erika Abraham, James H. Davenport, Matthew England, and Alberto Griggio. New Perspectives in Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 22072). In Dagstuhl Reports, Volume 12, Issue 2, pp. 67-86, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@Article{abraham_et_al:DagRep.12.2.67,
  author =	{Abraham, Erika and Davenport, James H. and England, Matthew and Griggio, Alberto},
  title =	{{New Perspectives in Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 22072)}},
  pages =	{67--86},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{12},
  number =	{2},
  editor =	{Abraham, Erika and Davenport, James H. and England, Matthew and Griggio, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.2.67},
  URN =		{urn:nbn:de:0030-drops-169310},
  doi =		{10.4230/DagRep.12.2.67},
  annote =	{Keywords: computer algebra systems, SMT Solvers, verification}
}

Document

DOI: 10.4230/OASIcs.ATMOS.2020.16

Probabilistic Simulation of a Railway Timetable

Authors: Rebecca Haehn, Erika Ábrahám, and Nils Nießen

Published in: OASIcs, Volume 85, 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)

Abstract

Railway systems are often highly utilized, which makes them vulnerable to delay propagation. In order to minimize delays timetables are desired to be robust, a property that is often estimated by simulating the respective timetable for different deterministic delay values. To achieve an accurate estimation under consideration of uncertain delays many simulation runs need to be executed. Most established simulation systems additionally use microscopic models of the railway systems, which further increases the simulations running times and makes them applicable rather for small areas of interest for complexity reasons. In this paper, we present a probabilistic, symbolic simulation algorithm for given timetables, this means we do not simulate individual executions, but all possible executions at once. We use a macroscopic model of the railway infrastructure as input. This way we consider the railway systems in less detail but are able to examine certain performance indicators for larger areas. For a given input model this simulation computes exact results. We implement the algorithm, examine its results, and discuss possible improvements of this approach.

Cite as

Rebecca Haehn, Erika Ábrahám, and Nils Nießen. Probabilistic Simulation of a Railway Timetable. In 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020). Open Access Series in Informatics (OASIcs), Volume 85, pp. 16:1-16:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{haehn_et_al:OASIcs.ATMOS.2020.16,
  author =	{Haehn, Rebecca and \'{A}brah\'{a}m, Erika and Nie{\ss}en, Nils},
  title =	{{Probabilistic Simulation of a Railway Timetable}},
  booktitle =	{20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)},
  pages =	{16:1--16:14},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-170-2},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{85},
  editor =	{Huisman, Dennis and Zaroliagis, Christos D.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2020.16},
  URN =		{urn:nbn:de:0030-drops-131527},
  doi =		{10.4230/OASIcs.ATMOS.2020.16},
  annote =	{Keywords: Railway, Modeling, Scheduling, Probabilistic systems, Optimization}
}

Document

DOI: 10.4230/DagRep.7.2.48

Computer-Assisted Engineering for Robotics and Autonomous Systems (Dagstuhl Seminar 17071)

Authors: Erika Abraham, Hadas Kress-Gazit, Lorenzo Natale, and Armando Tacchella

Published in: Dagstuhl Reports, Volume 7, Issue 2 (2017)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 17071 "Computer-Assisted Engineering for Robotics and Autonomous Systems". This seminar brought together researchers from three distinct communities -- Robotics, Model-driven Software Engineering, and Formal Methods -- to discuss the path towards creating safe and verifiable autonomous systems.

Cite as

Erika Abraham, Hadas Kress-Gazit, Lorenzo Natale, and Armando Tacchella. Computer-Assisted Engineering for Robotics and Autonomous Systems (Dagstuhl Seminar 17071). In Dagstuhl Reports, Volume 7, Issue 2, pp. 48-63, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@Article{abraham_et_al:DagRep.7.2.48,
  author =	{Abraham, Erika and Kress-Gazit, Hadas and Natale, Lorenzo and Tacchella, Armando},
  title =	{{Computer-Assisted Engineering for Robotics and Autonomous Systems (Dagstuhl Seminar 17071)}},
  pages =	{48--63},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{7},
  number =	{2},
  editor =	{Abraham, Erika and Kress-Gazit, Hadas and Natale, Lorenzo and Tacchella, Armando},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.7.2.48},
  URN =		{urn:nbn:de:0030-drops-73527},
  doi =		{10.4230/DagRep.7.2.48},
  annote =	{Keywords: analysis, artificial intelligence, autonomous systems, computer-aided software development, domain-specific languages, formal methods, model-driven software engineering, robotics, safety, synthesis, testing, verification}
}

Document

DOI: 10.4230/DagRep.5.11.71

Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471)

Authors: Erika Ábrahám, Pascal Fontaine, Thomas Sturm, and Dongming Wang

Published in: Dagstuhl Reports, Volume 5, Issue 11 (2016)

Abstract

The seminar focused on satisfiability checking for combinations of first-order logic and subclasses thereof with arithmetic theories in a very liberal sense, also covering quantifiers and parameters. It gathered members of the two communities of symbolic computation (or computer algebra) and satisfiability checking (including satisfiability modulo theories). Up-to-now, these two communities have been working quite independently. We are confident that the seminar will initiate cross-fertilization of both fields and bring improvements for both satisfiability checking and symbolic computation, and for their applications.

Cite as

Erika Ábrahám, Pascal Fontaine, Thomas Sturm, and Dongming Wang. Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471). In Dagstuhl Reports, Volume 5, Issue 11, pp. 71-89, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@Article{abraham_et_al:DagRep.5.11.71,
  author =	{\'{A}brah\'{a}m, Erika and Fontaine, Pascal and Sturm, Thomas and Wang, Dongming},
  title =	{{Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471)}},
  pages =	{71--89},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{11},
  editor =	{\'{A}brah\'{a}m, Erika and Fontaine, Pascal and Sturm, Thomas and Wang, Dongming},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.11.71},
  URN =		{urn:nbn:de:0030-drops-57657},
  doi =		{10.4230/DagRep.5.11.71},
  annote =	{Keywords: algorithmic algebra, arithmetic, automated reasoning, decision procedures, quantifier elimination, satisfiability checking, SMT solving, symbolic comp}
}

Document

DOI: 10.4230/DagRep.4.1.36

Randomized Timed and Hybrid Models for Critical Infrastructures (Dagstuhl Seminar 14031)

Authors: Erika Ábrahám, Alberto Avritzer, Anne Remke, and William H. Sanders

Published in: Dagstuhl Reports, Volume 4, Issue 1 (2014)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 14031 "Randomized Timed and Hybrid Models for Critical Infrastructures". Critical Infrastructures, such as power grid and water and gas distribution networks, are essential for the functioning of our society and economy. Randomized Timed and Hybrid Models appear as a natural choice for their modeling, and come with existing algorithms and tool support for their analysis. However, on the one hand, the Critical Infrastructures community does not yet make full use of recent advances for Randomized Timed and Hybrid Models. On the other hand, existing algorithms are not yet readily applicable to the special kind of problems arising in Critical Infrastructures. This seminar brought together researchers from these fields to communicate with each other and to exchange knowledge, experiences and needs.

Cite as

Erika Ábrahám, Alberto Avritzer, Anne Remke, and William H. Sanders. Randomized Timed and Hybrid Models for Critical Infrastructures (Dagstuhl Seminar 14031). In Dagstuhl Reports, Volume 4, Issue 1, pp. 36-82, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@Article{abraham_et_al:DagRep.4.1.36,
  author =	{\'{A}brah\'{a}m, Erika and Avritzer, Alberto and Remke, Anne and Sanders, William H.},
  title =	{{Randomized Timed and Hybrid Models for Critical Infrastructures (Dagstuhl Seminar 14031)}},
  pages =	{36--82},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{1},
  editor =	{\'{A}brah\'{a}m, Erika and Avritzer, Alberto and Remke, Anne and Sanders, William H.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.1.36},
  URN =		{urn:nbn:de:0030-drops-45355},
  doi =		{10.4230/DagRep.4.1.36},
  annote =	{Keywords: Critical Infrastructures, Smart Grids, Modeling, Randomized Timed and Hybrid Models, Analysis}
}

Document

DOI: 10.4230/DagSemProc.10271.2

A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra

Authors: Erika Abraham, Florian Corzilius, Ulrich Loup, and Thomas Sturm

Published in: Dagstuhl Seminar Proceedings, Volume 10271, Verification over discrete-continuous boundaries (2010)

Abstract

There are several methods for the synthesis and analysis of hybrid systems that require efficient algorithms and tools for satisfiability checking. For analysis, e.g., bounded model checking describes counterexamples of a fixed length by logical formulas, whose satisfiability corresponds to the existence of such a counterexample. As an example for parameter synthesis, we can state the correctness of a parameterized system by a logical formula; the solution set of the formula gives us possible safe instances of the parameters. For discrete systems, which can be described by propositional logic formulas, SAT-solvers can be used for the satisfiability checks. For hybrid systems, having mixed discrete-continuous behavior, SMT-solvers are needed. SMT-solving extends SAT with theories, and has its main focus on linear arithmetic, which is sufficient to handle, e.g., linear hybrid systems. However, there are only few solvers for more expressive but still decidable logics like the first-order theory of the reals with addition and multiplication -- real algebra. Since the synthesis and analysis of non-linear hybrid systems requires such a powerful logic, we need efficient SMT-solvers for real algebra. Our goal is to develop such an SMT-solver for the real algebra, which is both complete and efficient.

Cite as

Erika Abraham, Florian Corzilius, Ulrich Loup, and Thomas Sturm. A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra. In Verification over discrete-continuous boundaries. Dagstuhl Seminar Proceedings, Volume 10271, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{abraham_et_al:DagSemProc.10271.2,
  author =	{Abraham, Erika and Corzilius, Florian and Loup, Ulrich and Sturm, Thomas},
  title =	{{A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra}},
  booktitle =	{Verification over discrete-continuous boundaries},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10271},
  editor =	{Bernd Becker and Luca Cardelli and Holger Hermanns and Sofiene Tahar},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10271.2},
  URN =		{urn:nbn:de:0030-drops-27907},
  doi =		{10.4230/DagSemProc.10271.2},
  annote =	{Keywords: SMT-solving, Real Algebra, Hybrid Systems, Verification, Synthesis}
}

Document

DOI: 10.4230/DagSemProc.09461.3

SMT-Solving for the First-Order Theory of the Reals

Authors: Erika Abraham and Ulrich Loup

Published in: Dagstuhl Seminar Proceedings, Volume 9461, Algorithms and Applications for Next Generation SAT Solvers (2010)

Abstract

SAT-solving is a highly actual research area with increasing success and plenty of industrial applications. SMT-solving, extending SAT with theories, has its main focus on linear real constrains. However, there are only few solvers going further to more expressive but still decidable logics like the first-order theory of the reals with addition and multiplication. The main requests on theory solvers that must be fulfilled for their efficient embedding into an SMT solver are (a) incrementality, (b) the efficient computation of minimal infeasible subsets, and (c) the support of backtracking. For the first-order theory of the reals we are not aware of any solver offering those functionalities. In this work we address the possibilities to extend existing theory solving algorithms to come up with a theory solver suited for SMT.

Cite as

Erika Abraham and Ulrich Loup. SMT-Solving for the First-Order Theory of the Reals. In Algorithms and Applications for Next Generation SAT Solvers. Dagstuhl Seminar Proceedings, Volume 9461, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{abraham_et_al:DagSemProc.09461.3,
  author =	{Abraham, Erika and Loup, Ulrich},
  title =	{{SMT-Solving for the First-Order Theory of the Reals}},
  booktitle =	{Algorithms and Applications for Next Generation SAT Solvers},
  pages =	{1--7},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9461},
  editor =	{Bernd Becker and Valeria Bertacoo and Rolf Drechsler and Masahiro Fujita},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09461.3},
  URN =		{urn:nbn:de:0030-drops-25081},
  doi =		{10.4230/DagSemProc.09461.3},
  annote =	{Keywords: SMT-solving, first-order theory of the reals, verification}
}

Abraham, Erika

Document

DOI: 10.4230/DagRep.13.1.155

Integrated Rigorous Analysis in Cyber-Physical Systems Engineering (Dagstuhl Seminar 23041)

Authors: Erika Abraham, Stefan Hallerstede, John Hatcliff, Danielle Stewart, and Noah Abou El Wafa

Published in: Dagstuhl Reports, Volume 13, Issue 1 (2023)

Abstract

Cite as

Copy BibTex To Clipboard

@Article{abraham_et_al:DagRep.13.1.155,
  author =	{Abraham, Erika and Hallerstede, Stefan and Hatcliff, John and Stewart, Danielle and Wafa, Noah Abou El},
  title =	{{Integrated Rigorous Analysis in Cyber-Physical Systems Engineering (Dagstuhl Seminar 23041)}},
  pages =	{155--183},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{1},
  editor =	{Abraham, Erika and Hallerstede, Stefan and Hatcliff, John and Stewart, Danielle and Wafa, Noah Abou El},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.1.155},
  URN =		{urn:nbn:de:0030-drops-191209},
  doi =		{10.4230/DagRep.13.1.155},
  annote =	{Keywords: cyber-physical systems, formal methods, rigorous modelling and analysis, systems engineering}
}

Document

DOI: 10.4230/DagRep.12.2.67

New Perspectives in Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 22072)

Authors: Erika Abraham, James H. Davenport, Matthew England, and Alberto Griggio

Published in: Dagstuhl Reports, Volume 12, Issue 2 (2022)

Abstract

Cite as

Copy BibTex To Clipboard

@Article{abraham_et_al:DagRep.12.2.67,
  author =	{Abraham, Erika and Davenport, James H. and England, Matthew and Griggio, Alberto},
  title =	{{New Perspectives in Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 22072)}},
  pages =	{67--86},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{12},
  number =	{2},
  editor =	{Abraham, Erika and Davenport, James H. and England, Matthew and Griggio, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.2.67},
  URN =		{urn:nbn:de:0030-drops-169310},
  doi =		{10.4230/DagRep.12.2.67},
  annote =	{Keywords: computer algebra systems, SMT Solvers, verification}
}

Document

DOI: 10.4230/OASIcs.ATMOS.2020.16

Probabilistic Simulation of a Railway Timetable

Authors: Rebecca Haehn, Erika Ábrahám, and Nils Nießen

Published in: OASIcs, Volume 85, 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)

Abstract

Cite as

Copy BibTex To Clipboard

@InProceedings{haehn_et_al:OASIcs.ATMOS.2020.16,
  author =	{Haehn, Rebecca and \'{A}brah\'{a}m, Erika and Nie{\ss}en, Nils},
  title =	{{Probabilistic Simulation of a Railway Timetable}},
  booktitle =	{20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)},
  pages =	{16:1--16:14},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-170-2},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{85},
  editor =	{Huisman, Dennis and Zaroliagis, Christos D.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2020.16},
  URN =		{urn:nbn:de:0030-drops-131527},
  doi =		{10.4230/OASIcs.ATMOS.2020.16},
  annote =	{Keywords: Railway, Modeling, Scheduling, Probabilistic systems, Optimization}
}

Document

DOI: 10.4230/DagRep.7.2.48

Computer-Assisted Engineering for Robotics and Autonomous Systems (Dagstuhl Seminar 17071)

Authors: Erika Abraham, Hadas Kress-Gazit, Lorenzo Natale, and Armando Tacchella

Published in: Dagstuhl Reports, Volume 7, Issue 2 (2017)

Abstract

Cite as

Copy BibTex To Clipboard

@Article{abraham_et_al:DagRep.7.2.48,
  author =	{Abraham, Erika and Kress-Gazit, Hadas and Natale, Lorenzo and Tacchella, Armando},
  title =	{{Computer-Assisted Engineering for Robotics and Autonomous Systems (Dagstuhl Seminar 17071)}},
  pages =	{48--63},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{7},
  number =	{2},
  editor =	{Abraham, Erika and Kress-Gazit, Hadas and Natale, Lorenzo and Tacchella, Armando},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.7.2.48},
  URN =		{urn:nbn:de:0030-drops-73527},
  doi =		{10.4230/DagRep.7.2.48},
  annote =	{Keywords: analysis, artificial intelligence, autonomous systems, computer-aided software development, domain-specific languages, formal methods, model-driven software engineering, robotics, safety, synthesis, testing, verification}
}

Document

DOI: 10.4230/DagRep.5.11.71

Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471)

Authors: Erika Ábrahám, Pascal Fontaine, Thomas Sturm, and Dongming Wang

Published in: Dagstuhl Reports, Volume 5, Issue 11 (2016)

Abstract

Cite as

Copy BibTex To Clipboard

@Article{abraham_et_al:DagRep.5.11.71,
  author =	{\'{A}brah\'{a}m, Erika and Fontaine, Pascal and Sturm, Thomas and Wang, Dongming},
  title =	{{Symbolic Computation and Satisfiability Checking (Dagstuhl Seminar 15471)}},
  pages =	{71--89},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{11},
  editor =	{\'{A}brah\'{a}m, Erika and Fontaine, Pascal and Sturm, Thomas and Wang, Dongming},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.11.71},
  URN =		{urn:nbn:de:0030-drops-57657},
  doi =		{10.4230/DagRep.5.11.71},
  annote =	{Keywords: algorithmic algebra, arithmetic, automated reasoning, decision procedures, quantifier elimination, satisfiability checking, SMT solving, symbolic comp}
}

Document

DOI: 10.4230/DagRep.4.1.36

Randomized Timed and Hybrid Models for Critical Infrastructures (Dagstuhl Seminar 14031)

Authors: Erika Ábrahám, Alberto Avritzer, Anne Remke, and William H. Sanders

Published in: Dagstuhl Reports, Volume 4, Issue 1 (2014)

Abstract

Cite as

Copy BibTex To Clipboard

@Article{abraham_et_al:DagRep.4.1.36,
  author =	{\'{A}brah\'{a}m, Erika and Avritzer, Alberto and Remke, Anne and Sanders, William H.},
  title =	{{Randomized Timed and Hybrid Models for Critical Infrastructures (Dagstuhl Seminar 14031)}},
  pages =	{36--82},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{1},
  editor =	{\'{A}brah\'{a}m, Erika and Avritzer, Alberto and Remke, Anne and Sanders, William H.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.4.1.36},
  URN =		{urn:nbn:de:0030-drops-45355},
  doi =		{10.4230/DagRep.4.1.36},
  annote =	{Keywords: Critical Infrastructures, Smart Grids, Modeling, Randomized Timed and Hybrid Models, Analysis}
}

Document

DOI: 10.4230/DagSemProc.10271.2

A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra

Authors: Erika Abraham, Florian Corzilius, Ulrich Loup, and Thomas Sturm

Published in: Dagstuhl Seminar Proceedings, Volume 10271, Verification over discrete-continuous boundaries (2010)

Abstract

Cite as

Copy BibTex To Clipboard

@InProceedings{abraham_et_al:DagSemProc.10271.2,
  author =	{Abraham, Erika and Corzilius, Florian and Loup, Ulrich and Sturm, Thomas},
  title =	{{A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra}},
  booktitle =	{Verification over discrete-continuous boundaries},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10271},
  editor =	{Bernd Becker and Luca Cardelli and Holger Hermanns and Sofiene Tahar},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10271.2},
  URN =		{urn:nbn:de:0030-drops-27907},
  doi =		{10.4230/DagSemProc.10271.2},
  annote =	{Keywords: SMT-solving, Real Algebra, Hybrid Systems, Verification, Synthesis}
}

Document

DOI: 10.4230/DagSemProc.09461.3

SMT-Solving for the First-Order Theory of the Reals

Authors: Erika Abraham and Ulrich Loup

Published in: Dagstuhl Seminar Proceedings, Volume 9461, Algorithms and Applications for Next Generation SAT Solvers (2010)

Abstract

Cite as

Copy BibTex To Clipboard

@InProceedings{abraham_et_al:DagSemProc.09461.3,
  author =	{Abraham, Erika and Loup, Ulrich},
  title =	{{SMT-Solving for the First-Order Theory of the Reals}},
  booktitle =	{Algorithms and Applications for Next Generation SAT Solvers},
  pages =	{1--7},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9461},
  editor =	{Bernd Becker and Valeria Bertacoo and Rolf Drechsler and Masahiro Fujita},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09461.3},
  URN =		{urn:nbn:de:0030-drops-25081},
  doi =		{10.4230/DagSemProc.09461.3},
  annote =	{Keywords: SMT-solving, first-order theory of the reals, verification}
}

Search Results

Documents authored by Abraham, Erika

Ábrahám, Erika

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abraham, Erika

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Abstract

Cite as

Thanks for your feedback!

Could not send message