Zobrazeno 1 - 10
of 29
pro vyhledávání: '"S. Purushothaman Iyer"'
Publikováno v:
Computer. 39:61-67
With software playing an increasingly important role in medical devices, regulatory agencies such as the US Food and Drug Administration need effective means for assuring that this software is safe and reliable. The FDA has been striving for a more r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a3c3a0f4d6cb43f5339f6c70df408d6
https://doi.org/10.1109/mc.2006.113
https://doi.org/10.1109/mc.2006.113
Publikováno v:
Theoretical Computer Science. 342(2-3):316-350
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a model-checking algorithm for determining whether or not states in finite-state RPLTSs satisfy f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3ba3e36f26f2d0b40c5fe004ef23709
Publikováno v:
Information and Computation. 197(1-2):22-40
We consider the problem of deciding whether an infinite-state system (expressed as a Markov chain) satisfies a correctness property with probability 1. This problem is, of course, undecidable for general infinite-state systems. We focus our attention
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::67df5f22b11d092ad9f83f5839e58969
Publikováno v:
International Journal on Software Tools for Technology Transfer (STTT). 5:320-330
The design and functional complexity of medical devices have increased during the past 50 years, evolving from the use of a metronome circuit for the initial cardiac pacemaker to functions that include electrocardiogram analysis, laser surgery, and i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2fb49fb3acb70b29b2abe8dd4bf34d1
https://doi.org/10.1007/s10009-003-0137-2
https://doi.org/10.1007/s10009-003-0137-2
Publikováno v:
Formal Methods in System Design. 24:25-43
Net unfoldings have attracted great attention as a powerful technique for combating state space explosion in model checking, and have been applied to verification of finite state systems including 1-safe (finite) Petri nets and synchronous products o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eddfb5b40bed8773eb2cf38a1cc3c05e
https://doi.org/10.1023/b:form.0000004786.30007.f8
https://doi.org/10.1023/b:form.0000004786.30007.f8
Autor:
Jill Seaman, S. Purushothaman Iyer
Publikováno v:
Science of Computer Programming. 27(3):289-322
From a theoretical point of view, lazy evaluation corresponds to the call-by-name evaluation method, which substitutes arguments for parameters before evaluating them and never evaluates under a lambda. From an implementation perspective, lazy evalua
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7411f725968061333bdc45b58c7ab350
Autor:
Wuxu Peng, S. Purushothaman Iyer
Publikováno v:
International Journal of Foundations of Computer Science. :169-186
In this paper we consider pushdown automata on infinite trees with empty stack as the accepting condition (ω-EPDTA). We provide the following regarding ω-EPDTA: (a) its relationship to other Pushdown automata on infinite trees, (b) a Kleene-Closure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3457cbc6200457978599a20e7e4778bb
https://doi.org/10.1142/s0129054195000123
https://doi.org/10.1142/s0129054195000123
Publikováno v:
AsiaCCS
Remotely-launched software exploits are a common way for attackers to intrude into vulnerable computer systems. As detection techniques improve, remote exploitation techniques are also evolving. Recent techniques for evasion of exploit detection incl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a6cf8a2b05cd0b733a75c5497d83c7f
https://doi.org/10.1145/1229285.1229291
https://doi.org/10.1145/1229285.1229291
Autor:
Yu Lei, S. Purushothaman Iyer
Publikováno v:
FM 2005: Formal Methods ISBN: 9783540278825
FM
FM
We present an approach to directly unfold asynchronous communication protocols that are modeled as a group of Extended Finite State Machines (EFSMs) communicating through shared message queues. A novel aspect of our approach is that we reduce the red
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::65b46793eac77a47287b020b3320443f
https://doi.org/10.1007/11526841_23
https://doi.org/10.1007/11526841_23
Publikováno v:
Formal Techniques for Networked and Distributed Sytems — FORTE 2002 ISBN: 9783540001416
FORTE
FORTE
We report on the design, implementation, and use of C Wolf, a toolset which extracts finite labeled transition systems from C programs. The extraction process is guided by user input on how a program should be abstracted, and what events should be ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2f1f9c596939d0d416153124d5ebb59
https://doi.org/10.1007/3-540-36135-9_17
https://doi.org/10.1007/3-540-36135-9_17