SwePub
Sök i SwePub databas

  Utökad sökning

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

Sökning: LAR1:uu

  • Resultat 1541-1550 av 273427
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1541.
  • Abdulla, Parosh Aziz, 1961-, et al. (författare)
  • Parameterized verification under TSO is PSPACE-complete
  • 2020
  • Ingår i: 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
  • Tidskriftsartikel (refereegranskat)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.
  •  
1542.
  •  
1543.
  • Abdulla, Parosh Aziz, et al. (författare)
  • Precise and sound automatic fence insertion procedure under PSO
  • 2015
  • Ingår i: Networked Systems. - Cham : Springer. - 9783319268491 ; , s. 32-47
  • Konferensbidrag (refereegranskat)abstract
    • We give a sound and complete procedure for fence insertion for concurrent finite-state programs running under the PSO memory model. This model allows ''write to read'' and ''write-to-write'' relaxations corresponding to the addition of an unbounded store buffers between processors and the main memory. We introduce a novel machine model, called the Hierarchical Single-Buffer (HSB) semantics, and show that the reachability problem for a program under PSO can be reduced to the reachability problem under HSB. We present a simple and effective backward reachability analysis algorithm for the latter, and propose a counter-example guided fence insertion procedure. The procedure infers automatically a minimal set of fences that ensure correctness of the program. We have implemented a prototype and run it successfully on all standard benchmarks, together with several challenging examples.
  •  
1544.
  • Abdulla, Parosh Aziz, et al. (författare)
  • Priced timed Petri nets
  • 2013
  • Ingår i: Logical Methods in Computer Science. - 1860-5974. ; 9:4, s. 10:1-51
  • Tidskriftsartikel (refereegranskat)
  •  
1545.
  •  
1546.
  • Abdulla, Parosh Aziz, et al. (författare)
  • Push-down automata with gap-order constraints
  • 2013
  • Ingår i: Fundamentals of Software Engineering. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642402128 ; , s. 199-216
  • Konferensbidrag (refereegranskat)
  •  
1547.
  • Abdulla, Parosh Aziz, et al. (författare)
  • R-automata
  • 2008
  • Ingår i: CONCUR 2008 - Concurrency Theory. - Berlin : Springer-Verlag. - 9783540853602 ; , s. 67-81
  • Konferensbidrag (refereegranskat)abstract
    • We introduce R-automata - finite state machines which operate on a finite number of unbounded counters. The values of the counters can be incremented, reset to zero, or left unchanged along the transitions. R-automata can be, for example, used to model systems with resources (modeled by the counters) which are consumed in small parts but which can be replenished at once. We define the language accepted by an R-automaton relative to a natural number D as the set of words allowing a run along which no counter value exceeds D. As the main result, we show decidability of the universality problem, i.e., the problem whether there is a number D such that the corresponding language is universal. We present a proof based on finite monoids and the factorization forest theorem. This theorem was applied for distance automata in [12] - a special case of R-automata with one counter which is never reset. As a second technical contribution, we extend the decidability result to R-automata with Buchi acceptance conditions.
  •  
1548.
  • Abdulla, Parosh Aziz, et al. (författare)
  • R-automata
  • 2008
  • Rapport (övrigt vetenskapligt/konstnärligt)abstract
    • We introduce \emphR-automata – a model for analysis of systems with resources which are consumed in small parts but which can be replenished at once. An R-automaton is a finite state machine which operates on a finite number of unbounded counters (modeling the resources). The values of the counters can be incremented, reset to zero, or left unchanged along the transitions. We define the language accepted by an R-automaton relative to a natural number D as the set of words allowing a run along which no counter value exceeds D. As the main result, we show decidability of the universality problem, i.e., the problem whether there is a number D such that the corresponding language is universal. The decidability proof is based on a reformulation of the problem in the language of finite monoids and solving it using the factorization forest theorem. This approach extends the way in which the factorization forest theorem was used to solve the limitedness problem for distance automata in Simon, 1994. We also show decidability of the non-emptiness problem and the limitedness problem, i.e., whether there is a natural number D such that the corresponding language is non-empty resp.\ all the accepted words can also be accepted with counter values smaller than D. Finally, we extend the decidability results to R-automata with Büchi acceptance conditions.
  •  
1549.
  • Abdulla, Parosh Aziz, Professor, et al. (författare)
  • Reachability in database-driven systems with numerical attributes under recency bounding
  • 2019
  • Ingår i: PODS '19. - New York, NY, USA : ACM Press. - 9781450362276 ; , s. 335-352
  • Konferensbidrag (refereegranskat)abstract
    • A prominent research direction of the database theory community is to develop techniques for verification of database-driven systems operating over relational and numerical data. Along this line, we lift the framework of database manipulating systems [3] which handle relational data to also accommodate numerical data and the natural order on them. We study an under-approximation called recency bounding under which the most basic verification problem-reachability, is decidable. Even under this under-approximation the reachability space is infinite in multiple dimensions - owing to the unbounded sizes of the active domain, the unbounded numerical domain it has access to, and the unbounded length of the executions. We show that, nevertheless, reachability is ExpTime complete. Going beyond reachability to LTL model checking renders verification undecidable.
  •  
1550.
  • Abdulla, Parosh Aziz, Professor, 1961-, et al. (författare)
  • Recency-Bounded Verification of Dynamic Database-Driven Systems
  • 2016
  • Ingår i: PODS'16. - New York, NY, USA : ACM. ; , s. 195-210
  • Konferensbidrag (refereegranskat)abstract
    • We propose a formalism to model database-driven systems, called database manipulating systems (DMS). The actions of a DMS modify the current instance of a relational database by adding new elements into the database, deleting tuples from the relations and adding tuples to the relations. The elements which are modified by an action are chosen by (full) first-order queries. DMS is a highly expressive model and can be thought of as a succinct representation of an in finite state relational transition system, in line with similar models proposed in the literature. We propose monadic second order logic (MSO-FO) to reason about sequences of database instances appearing along a run. Unsurprisingly, the linear-time model checking problem of DMS against MSO-FO is undecidable. Towards decidability, we propose under-approximate model checking of DMS, where the under-approximation parameter is the "bound on recency". In a k-recency-bounded run, only the most recent k elements in the current active domain may be modified by an action. More runs can be verified by increasing the bound on recency. Our main result shows that recency-bounded model checking of DMS against MSO-FO is decidable, by a reduction to the satisfiability problem of MSO over nested words.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1541-1550 av 273427
Typ av publikation
tidskriftsartikel (154535)
doktorsavhandling (27083)
bokkapitel (24287)
konferensbidrag (24235)
annan publikation (10578)
recension (8800)
visa fler...
rapport (7064)
bok (6261)
forskningsöversikt (4524)
samlingsverk (redaktörskap) (3758)
licentiatavhandling (1412)
proceedings (redaktörskap) (555)
patent (304)
konstnärligt arbete (194)
visa färre...
Typ av innehåll
refereegranskat (162194)
övrigt vetenskapligt/konstnärligt (95842)
populärvet., debatt m.m. (15153)
Författare/redaktör
Ekelöf, Tord (1165)
Brenner, Richard (1125)
Ellert, Mattias (1110)
Larsson, Anders (1083)
Strandberg, Jonas (1055)
Zwalinski, L. (1024)
visa fler...
Bohm, Christian (906)
Abbott, B. (806)
Aad, G (770)
Kupsc, Andrzej (761)
Silverstein, Samuel ... (756)
Janson, Christer (745)
Lund-Jensen, Bengt (716)
Moa, Torbjörn (706)
Hellman, Sten (678)
Wolke, Magnus (669)
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)
visa färre...
Lärosäte
Uppsala universitet (273427)
Karolinska Institutet (17641)
Lunds universitet (6944)
Stockholms universitet (6563)
Kungliga Tekniska Högskolan (6299)
Umeå universitet (5306)
visa fler...
Göteborgs universitet (4933)
Linköpings universitet (4685)
Örebro universitet (2893)
Sveriges Lantbruksuniversitet (2248)
Högskolan Dalarna (1669)
Södertörns högskola (1381)
Linnéuniversitetet (1367)
Mälardalens universitet (1362)
Högskolan i Gävle (1190)
Chalmers tekniska högskola (1048)
Karlstads universitet (851)
Mittuniversitetet (849)
Luleå tekniska universitet (603)
Jönköping University (570)
RISE (452)
Malmö universitet (427)
Marie Cederschiöld högskola (376)
Högskolan i Skövde (286)
Försvarshögskolan (236)
Naturhistoriska riksmuseet (204)
Handelshögskolan i Stockholm (199)
Högskolan i Borås (172)
Nordiska Afrikainstitutet (165)
Högskolan i Halmstad (145)
Högskolan Kristianstad (136)
Sophiahemmet Högskola (136)
Gymnastik- och idrottshögskolan (132)
Röda Korsets Högskola (124)
Enskilda Högskolan Stockholm (116)
Institutet för språk och folkminnen (114)
Högskolan Väst (54)
Riksantikvarieämbetet (47)
Blekinge Tekniska Högskola (39)
VTI - Statens väg- och transportforskningsinstitut (26)
Kungl. Musikhögskolan (18)
Naturvårdsverket (11)
IVL Svenska Miljöinstitutet (11)
Konstfack (9)
Nationalmuseum (3)
Stockholms konstnärliga högskola (1)
Havs- och vattenmyndigheten (1)
visa färre...
Språk
Engelska (214196)
Svenska (39186)
Latin (11968)
Odefinierat språk (3147)
Tyska (1454)
Franska (898)
visa fler...
Spanska (326)
Ryska (303)
Norska (266)
Danska (262)
Polska (170)
Italienska (148)
Finska (137)
Nederländska (128)
Estniska (119)
Isländska (88)
Grekiska, klassisk (81)
Turkiska (61)
Japanska (47)
Esperanto (46)
Kinesiska (43)
Ungerska (40)
Persiska (39)
Portugisiska (38)
Hindi (30)
Lettiska (24)
Bulgariska (20)
Nygrekiska (14)
Arabiska (13)
Tjeckiska (13)
Kroatiska (12)
Nynorsk (12)
Koreanska (11)
Iriska (10)
Serbiska (8)
Albanska (8)
Ukrainska (7)
Baluchi (7)
Katalanska (6)
Flera språk (5)
Hebreiska (5)
Rumänska (5)
Kurdiska (5)
Slovakiska (5)
Bokmål (5)
Vietnamesiska (3)
Slovenska (1)
Färöiska (1)
Makedonska (1)
Swahili (1)
Mongoliskt språk (1)
Urdu (1)
Indonesiska (1)
Frisiska (1)
visa färre...
Forskningsämne (UKÄ/SCB)
Naturvetenskap (59717)
Medicin och hälsovetenskap (44972)
Humaniora (43310)
Samhällsvetenskap (37972)
Teknik (11451)
Lantbruksvetenskap (1874)

År

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 Stäng

Kopiera och spara länken för att återkomma till aktuell vy