Zobrazeno 1 - 10
of 45
pro vyhledávání: '"David Purser"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 1 (2022)
Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater than some constant multiple of the weight in the second. We show that the problem is unde
Externí odkaz:
https://doaj.org/article/f5269d9e3ba94646aa7f33436fc96eef
Autor:
David Purser
Publikováno v:
ACM SIGLOG News. 10:52-61
An annual award, called the Alonzo Church Award for Outstanding Contributions to Logic and Computation, was established in 2015 by the ACM Special Interest Group for Logic and Computation (SIGLOG), the European Association for Theoretical Computer Sc
Autor:
David Purser
Publikováno v:
ACM SIGLOG News. 9:44-49
The ACM Special Interest Group on Logic (SIGLOG), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), and the Kurt Goedel Society (KGS) are pleased to announce that
Autor:
David Purser
Publikováno v:
ACM SIGLOG News. 8:25-32
Autor:
Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, David Purser, Anton Varonka, Markus A. Whiteland, James Worrell
Publikováno v:
Proceedings of the ACM on Programming Languages
49th ACM SIGPLAN Symposium on Principles of Programming Languages
Proceedings of the ACM Symposium on Programming Languages
49th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2022)
49th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2022), Jan 2022, Philadelphia, United States. pp.1-25, ⟨10.1145/3498727⟩
49th ACM SIGPLAN Symposium on Principles of Programming Languages
Proceedings of the ACM Symposium on Programming Languages
49th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2022)
49th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2022), Jan 2022, Philadelphia, United States. pp.1-25, ⟨10.1145/3498727⟩
We consider the MSO model-checking problem for simple linear loops, or equivalently discrete-time linear dynamical systems, with semialgebraic predicates (i.e., Boolean combinations of polynomial inequalities on the variables). We place no restrictio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72dc8962ca06e585c8cfd31f332f8ff6
https://doi.org/10.1145/3498727
https://doi.org/10.1145/3498727
Autor:
Richard O. Kirk, David Purser, Liam Steadman, Matthew Bradbury, Gregory M. F. Watson, Melissa Jane Kenny
Publikováno v:
Exchanges: The Interdisciplinary Research Journal. 6:86-101
The Warwick Postgraduate Colloquium in Computer Science (WPCCS) is an annual event for research students in the Department of Computer Science at the University of Warwick. The aims of the colloquium are to provide: (i) an experience of a conference
Publikováno v:
Computer Aided Verification
Lecture Notes in Computer Science
Computer Aided Verification ISBN: 9783030816872
Lecture Notes in Computer Science-Computer Aided Verification
Computer Aided Verification-33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part II
Lecture Notes in Computer Science
Computer Aided Verification ISBN: 9783030816872
Lecture Notes in Computer Science-Computer Aided Verification
Computer Aided Verification-33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part II
We introduce the notion of porous invariants for multipath (or branching/nondeterministic) affine loops over the integers; these invariants are not necessarily convex, and can in fact contain infinitely many 'holes'. Nevertheless, we show that in man
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aaea34174832c44ecf4bceeae5103190
https://hdl.handle.net/21.11116/0000-0009-2EDB-E21.11116/0000-0009-2EDD-C
https://hdl.handle.net/21.11116/0000-0009-2EDB-E21.11116/0000-0009-2EDD-C
Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater than some constant multiple of the weight in the second. We show that the problem is undec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::376befd64d8ce505239cbacb6c34121c
Autor:
Ken Dunn, Rosadi Seswandhana, Barry Voight, Jean-Christophe Komorowski, Peter J. Baxter, Ian Shelley, Susanna F. Jenkins, David Purser
Publikováno v:
Burns. 43:1051-1069
This study of burns patients from two eruptions of Merapi volcano, Java, in 1994 and 2010, is the first detailed analysis to be reported of thermal injuries in a large series of hospitalised victims of pyroclastic surges, one of the most devastating
Publikováno v:
Forensic Science International. 277:77-87
Dwelling fires have changed over the years because building contents and the materials used in then have changed. They all contribute to an ever-growing diversity of chemical species found in fires, many of them highly toxic. These arise largely from