XML graphs in program analysis

Autor: Michael I. Schwartzbach, Anders Møller

Publikováno v: PEPM
Møller, A & Schwartzbach, M I 2011, ' XML Graphs in Program Analysis ', Science of Computer Programming, vol. 76, no. 6, pp. 492-515 . https://doi.org/10.1016/j.scico.2009.11.007
Møller, A & Schwartzbach, M I 2007, XML Graphs in Program Analysis . in G Ramalingam & E Visser (eds), Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation . Association for Computing Machinery, pp. 1-10, Nice, France, 15/01/2007 . https://doi.org/10.1145/1244381.1244383

XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, out

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df6dbb48ffc7eb547e836bf76d3af9c3

The project

Autor: Claus Brabrand, Anders Møller, Michael I. Schwartzbach

Publikováno v: Brabrand, C, Møller, A & Schwartzbach, M I 2002, ' The Project ', A C M Transactions on Internet Technology, vol. 2, no. 2, pp. 79-114 . https://doi.org/10.1145/514183.514184

We present the results of the project, which aims to design and implement a high-level domain-specific language for programming interactive Web services. A fundamental aspect of the development of the World Wide Web during the last decade is the grad

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c551bb2e613ccfd4ce459ac4c9d2681
https://doi.org/10.1145/514183.514184

The pointer assertion logic engine

Autor: Michael I. Schwartzbach, Anders Møller

Publikováno v: PLDI
BRICS Report Series; No 39 (2000): RS-39 The Pointer Assertion Logic Engine
BRICS Report Series; Nr. 39 (2000): RS-39 The Pointer Assertion Logic Engine

We present a new framework for verifying partial specifications of programs in order to catch type and memory errors and check data structure invariants. Our technique can verify a large class of data structures, namely all those that can be expresse

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a54f0b811ab5b926c26d0b34bc7b693e
https://doi.org/10.1145/381694.378851

A domain-specific language for regular sets of strings and trees

Autor: Nils Klarlund, Michael I. Schwartzbach

Publikováno v: DSL
Schwartzbach, M I & Klarlund, N 1999, ' A Domain-Specific Languane for Regular Sets of Strings and Trees ', I E E E Transactions on Software Engineering, vol. 25, no. 3, pp. 378-386 . https://doi.org/10.1109/32.798326

We propose a novel high level programming notation, called FIDO, that we have designed to concisely express regular sets of strings or trees. In particular, it can be viewed as a domain-specific language for the expression of finite state automata on

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e802697c2e8dd176a80c9e1fc97f992
https://doi.org/10.1109/32.798326

WebSelF: A Web Scraping Framework

Autor: Jakob G. Thomsen, Michael I. Schwartzbach, Claus Brabrand, Erik Ernst

Publikováno v: Lecture Notes in Computer Science ISBN: 9783642317521
ICWE

We present WebSelF, a framework for web scraping which models the process of web scraping and decomposes it into four conceptually independent, reusable, and composable constituents. We have validated our framework through a full parameterized implem

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::cec2b139861fb22fd4457c1828e6ae43
https://doi.org/10.1007/978-3-642-31753-8_28