SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "LAR1:uu "

Search: LAR1:uu

  • Result 1531-1540 of 272934
Sort/group result
   
EnumerationReferenceCoverFind
1531.
  •  
1532.
  • Abdulla, Parosh Aziz, et al. (author)
  • Norn: An SMT Solver for String Constraints
  • 2015
  • In: COMPUTER AIDED VERIFICATION, PT I. - Cham : SPRINGER-VERLAG BERLIN. - 9783319216904 - 9783319216898 ; , s. 462-469
  • Conference paper (peer-reviewed)abstract
    • We present version 1.0 of the Norn SMT solver for string constraints. Norn is a solver for an expressive constraint language, including word equations, length constraints, and regular membership queries. As a feature distinguishing Norn from other SMT solvers, Norn is a decision procedure under the assumption of a set of acyclicity conditions on word equations, without any restrictions on the use of regular membership.
  •  
1533.
  • Abdulla, Parosh Aziz, et al. (author)
  • On-the-fly analysis of systems with unbounded, lossy FIFO channels
  • 1998
  • In: Computer Aided Verification. - 9783540646082 - 9783540693390 ; , s. 305-318
  • Conference paper (peer-reviewed)abstract
    • We consider symbolic on-the-fly verification methods for systems of finite-state machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation formalism, called simple regular expressions (SREs), for representing sets of states of protocols with lossy FIFO channels. We show that the class of languages representable by SREs is exactly the class of downward closed languages that arise in the analysis of such protocols. We give methods for (i) computing inclusion between SREs, (ii) an SRE representing the set of states reachable by executing a single transition in a system, and (iii) an SRE representing the set of states reachable by an arbitrary number of executions of a control loop of a program. All these operations are rather simple and can be carried out in polynomial time. With these techniques, one can construct a semi-algorithm which explores the set of reachable states of a protocol, in order to check various safety properties.
  •  
1534.
  • Abdulla, Parosh Aziz, et al. (author)
  • On the verification of timed ad hoc networks
  • 2011
  • In: Formal Modeling and Analysis of Timed Systems. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642243097 ; , s. 256-270
  • Conference paper (peer-reviewed)
  •  
1535.
  • Abdulla, Parosh Aziz, et al. (author)
  • Parameterized tree systems
  • 2008
  • In: Formal Techniques for Networked and Distributed Systems. - Berlin : Springer-Verlag. - 9783540688549 ; , s. 69-83
  • Conference paper (peer-reviewed)abstract
    • Several recent works have considered parameterized verification, i.e. automatic verification of systems consisting of an arbitrary number of finite-state processes organized in a linear array. The aim of this paper is to extend these works by giving a simple and efficient method to prove safety properties for systems with tree-like architectures. A process in the system is a finite-state automaton and a transition is performed jointly by a process and its parent and children processes. The method derives an over-approximation of the induced transition system, which allows the use of finite trees as symbolic representations of infinite sets of configurations. Compared to traditional methods for parameterized verification of systems with tree topologies, our method does not require the manipulation of tree transducers, hence its simplicity and efficiency. We have implemented a prototype which works well on several nontrivial tree-based protocols.
  •  
1536.
  • Abdulla, Parosh A., et al. (author)
  • Parameterized verification
  • 2016
  • In: International Journal on Software Tools for Technology Transfer. - : Springer Science and Business Media LLC. - 1433-2779 .- 1433-2787. ; 18:5, s. 469-473
  • Journal article (other academic/artistic)abstract
    • The goal of parameterized verification is to prove the correctness of a system specification regardless of the number of its components. The problem is of interest in several different areas: verification of hardware design, multithreaded programs, distributed systems, and communication protocols. The problem is undecidable in general. Solutions for restricted classes of systems and properties have been studied in areas like theorem proving, model checking, automata and logic, process algebra, and constraint solving. In this introduction to the special issue, dedicated to a selection of works from the Parameterized Verification workshop PV '14 and PV '15, we survey some of the works developed in this research area.
  •  
1537.
  • Abdulla, Parosh Aziz, et al. (author)
  • Parameterized verification of time-sensitive models of ad hoc network protocols
  • 2016
  • In: Theoretical Computer Science. - : Elsevier BV. - 0304-3975 .- 1879-2294. ; 612, s. 1-22
  • Journal article (peer-reviewed)abstract
    • We study decidability and undecidability results for parameterized verification of a formal model of timed Ad Hoc network protocols. The communication topology is defined by an undirected graph and the behaviour of each node is defined by a timed automaton communicating with its neighbours via broadcast messages. We consider parameterized verification problems formulated in terms of reachability. In particular we are interested in searching for an initial configuration from which an individual node can reach an error state. We study the problem for dense and discrete time and compare the results with those obtained for (fully connected) networks of timed automata.
  •  
1538.
  • Abdulla, Parosh Aziz, et al. (author)
  • Parameterized verification through view abstraction
  • 2016
  • In: International Journal on Software Tools for Technology Transfer. - : Springer Science and Business Media LLC. - 1433-2779 .- 1433-2787. ; 18:5, s. 495-516
  • Journal article (peer-reviewed)abstract
    • We present a simple and efficient framework for automatic verification of systems with a parametric number of communicating processes. The processes may be organized in various topologies such as words, multisets, rings, or trees. Our method needs to inspect only a small number of processes in order to show correctness of the whole system. It relies on an abstraction function that views the system from the perspective of a fixed number of processes. The abstraction is used during the verification procedure in order to dynamically detect cut-off points beyond which the search of the state space need not continue. We show that the method is complete for a large class of well quasi-ordered systems including Petri nets. Our experimentation on a variety of benchmarks demonstrate that the method is highly efficient and that it works well even for classes of systems with undecidable verification problems. In particular, the method handles the fine-grained and full version of Szymanski's mutual exclusion protocol, whose correctness, to the best of our knowledge, has not been proven automatically by any other existing methods.
  •  
1539.
  • Abdulla, Parosh Aziz, 1961-, et al. (author)
  • Parameterized verification under TSO is PSPACE-complete
  • 2020
  • In: Proceedings of the ACM on Programming Languages. - New York, NY, USA : Association for Computing Machinery (ACM). - 2475-1421. ; 4:POPL, s. 26:1-26:29
  • Journal article (peer-reviewed)abstract
    • We consider parameterized verification of concurrent programs under the Total Store Order (TSO) semantics. A program consists of a set of processes that share a set of variables on which they can perform read and write operations. We show that the reachability problem for a system consisting of an arbitrary number of identical processes is PSPACE-complete. We prove that the complexity is reduced to polynomial time if the processes are not allowed to read the initial values of the variables in the memory. When the processes are allowed to perform atomic read-modify-write operations, the reachability problem has a non-primitive recursive complexity.
  •  
1540.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1531-1540 of 272934
Type of publication
journal article (154143)
doctoral thesis (27081)
book chapter (24261)
conference paper (24213)
other publication (10567)
review (8796)
show more...
reports (7058)
book (6256)
research review (4508)
editorial collection (3752)
licentiate thesis (1410)
editorial proceedings (554)
patent (304)
artistic work (193)
show less...
Type of content
peer-reviewed (161789)
other academic/artistic (95778)
pop. science, debate, etc. (15129)
Author/Editor
Ekelöf, Tord (1163)
Brenner, Richard (1123)
Ellert, Mattias (1108)
Larsson, Anders (1080)
Strandberg, Jonas (1053)
Zwalinski, L. (1022)
show more...
Bohm, Christian (906)
Abbott, B. (806)
Aad, G (770)
Kupsc, Andrzej (760)
Silverstein, Samuel ... (756)
Janson, Christer (739)
Lund-Jensen, Bengt (716)
Moa, Torbjörn (706)
Hellman, Sten (678)
Wolke, Magnus (668)
Zhu, J. (647)
Peters, K. (632)
Clement, Christophe (626)
Liu, Y. (622)
Sjölin, Jörgen (620)
Meyer, J. (613)
Zhou, B. (613)
Fox, H. (611)
Evans, H. (609)
Gutierrez, P. (608)
Brandt, A. (607)
Brock, R. (607)
Burdin, S. (607)
Kupco, A. (607)
Pleier, M. -A. (607)
Qian, J. (607)
Quadt, A. (607)
Sawyer, L. (607)
Stark, J. (607)
Borissov, G. (606)
Cooke, M. (606)
Kehoe, R. (606)
Lokajicek, M. (606)
Schwienhorst, R. (606)
Snyder, S. (606)
Watts, G. (606)
Khanov, A. (605)
Severini, H. (605)
Shabalina, E. (605)
Rizatdinova, F. (604)
Strauss, M. (604)
Fiedler, F. (603)
Hohlfeld, M. (603)
Tsybychev, D. (603)
show less...
University
Uppsala University (272934)
Karolinska Institutet (17618)
Lund University (6932)
Stockholm University (6560)
Royal Institute of Technology (6294)
Umeå University (5300)
show more...
University of Gothenburg (4920)
Linköping University (4670)
Örebro University (2879)
Swedish University of Agricultural Sciences (2248)
Högskolan Dalarna (1665)
Södertörn University (1381)
Linnaeus University (1367)
Mälardalen University (1360)
University of Gävle (1190)
Chalmers University of Technology (1044)
Mid Sweden University (849)
Karlstad University (848)
Luleå University of Technology (601)
Jönköping University (568)
RISE (450)
Malmö University (425)
Marie Cederschiöld högskola (376)
University of Skövde (284)
Swedish National Defence College (236)
Swedish Museum of Natural History (203)
Stockholm School of Economics (197)
University of Borås (172)
The Nordic Africa Institute (165)
Halmstad University (145)
Sophiahemmet University College (136)
Kristianstad University College (134)
The Swedish School of Sport and Health Sciences (132)
Red Cross University College (124)
University College Stockholm (117)
The Institute for Language and Folklore (114)
University West (54)
Swedish National Heritage Board (47)
Blekinge Institute of Technology (37)
VTI - The Swedish National Road and Transport Research Institute (25)
Royal College of Music (18)
Swedish Environmental Protection Agency (11)
IVL Swedish Environmental Research Institute (11)
University College of Arts, Crafts and Design (9)
Nationalmuseum (3)
Stockholm University of the Arts (1)
Swedish Agency for Marine and Water Management (1)
show less...
Language
English (213760)
Swedish (39150)
Latin (11968)
Undefined language (3147)
German (1445)
French (897)
show more...
Spanish (324)
Russian (303)
Norwegian (265)
Danish (261)
Polish (170)
Italian (147)
Finnish (136)
Dutch (128)
Estonian (116)
Icelandic (88)
Greek, Ancient (81)
Turkish (61)
Japanese (47)
Esperanto (46)
Chinese (43)
Hungarian (40)
Persian (39)
Portuguese (38)
Hindi (29)
Latvian (24)
Bulgarian (20)
Greek, Modern (14)
Arabic (13)
Czech (13)
Croatian (12)
Nynorsk (12)
Korean (11)
Irish (10)
Serbian (8)
Albanian (8)
Ukranian (7)
Baluchi (7)
Catalan (6)
Multiple languages (5)
Hebrew (5)
Romanian (5)
Kurdish (5)
Slovak (5)
Bokmål (5)
Vietnamese (3)
Slovenian (1)
Faroese (1)
Macedonian (1)
Swahili (1)
Mongolian (1)
Indonesian (1)
Frisian (1)
show less...
Research subject (UKÄ/SCB)
Natural sciences (59561)
Medical and Health Sciences (44802)
Humanities (43234)
Social Sciences (37886)
Engineering and Technology (11413)
Agricultural Sciences (1870)

Year

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view