Fundamental Approaches to Software Engineering: Third International Conference, FASE 2000 Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 - April 2, 2000 Proceedings

... PathFinder (JPF) [2] to check business logic properties of web applications ... paper, we present an approach to closing web applications with a driver that ... automated PTG extraction for JSP-based web applications, using Struts1 as an ...

... password (fragment) expect different reaction sequences to an incoming message to be justified by different source ... UML. 2.0. State. Machines. The generated I/O-automaton for the integrated behaviour of a system object in scenarios can be ...

... University of Illinois at Urbana-Champaign (2007), http://www.cs.le.ac.uk/people/ab373/papers/ UIUC-TR-MOF-OCL ... 105–112 (2004) 8. Seidewitz, E.: What models mean. Software, IEEE 20(5), 26–32 (2003) 9. Kuhne, T.: Matters of (meta ...

... Business Constraints with the Event Calculus. Technical Report DEIS-LIA-002- 11, University of Bologna (Italy) (2011), LIA Series no. 97, http://www.lia.deis.unibo.it/Research/TechReport/LIA-002-11.pdf 9. Maggi, F.M., Montali, M ...

... Matlab mod- els . Our work differs from both [ 11 ] and [ 21 ] by exploring product line commonalities and variabilities for any type of model that can be represented as XMI and by providing a formal proof of correctness of our approach ...

... Rational: Rational software. At URL http://www-306.ibm.com/software ... guide version 1.0.1. At URL http://www.omg.org/docs/omg/ 03-06-01.pdf (2003) 22. Siikarla, M ... RequisitePro. At URL http://www3.software.ibm.com/ ibmdl/pub/software ...

... http://forum.xda-developers.com/ showthread.php?t=2124002 2. Alur, R., Etessami, K., Yannakakis, M.: Inference of message sequence charts. In: ICSE 2000, pp. 304–313 (2000). http://doi.acm.org/10.1145/337180.337215 3. Alvin, C ...

... CMock [7] and Cgreen [5]) have very limited functionality. Instead, we compare to Google Mock. Google Mock provides mocking functionality for C++ and is feature-wise close to jMock [11] and EasyMock [8] for Java. Thus it should, to the ...

... Microsoft Office 365, or solutions like ShareLaTeX/Overleaf that even free one from maintaining a corresponding build and runtime environment. Key to the realization of Pyro is that Cinco follows a fully generative approach on the meta ...

... xvid 3 ) and to events with identifiers equal to 4 respectively . The environment can thus remove elements from or add elements to the buffer as it wills . However , since the programs add and remove do not allow interference , any ...

... Bmi is another famous example taken from software testing papers. Calc is our last example with Sequence activity that implements basic calculator ... Java. All the experiments ran on a 13” MacBook Pro (Late 2011) with a 2.4 GHz Intel Core i5 ...

... testing of mobile applications gradually became a very important topic in the last decade with the growing mobile application market. We propose Test Case Mutation (TCM) which mutates existing test cases to produce richer test cases. These ...

... software developers are required to specify objects, which have widgets on GUI windows in the sequence diagrams. Thus, our system can specify the widgets that correspond to the objects, and our method can operate the tutorial system for ...

... services. In: Proc. of CAMPUS (DisCoTec), vol. 11 (2008) Di Marco, A., Mascolo, C.: Performance analysis and ... Online Monitoring of Web-Service SLAs. In: Proc. of the 16th ACM SIGSOFT/FSE ... Adaptive Services: The PLASTIC Approach 139.

... Sudoku and ICCM(c) (Import Coupling of a class c for Classes with distinct ... five levels of difficulty have also equal chances to be selected (F10 (x 10) ... high between executions producing the same coupling value (average IS per class ...

... axiom Lemma 5 (Cut elimination on an expanded net). Let t be an expanded net. A cut in t with a completely expanded axiom exp(a) reduces in t like in an ordinary axiom cut. In other words, !A ?A⊥ !A exp( ) !A RE Cut + Ax Proof. We ...

... sleeping barber problem [And91]. The barber allows a new customer into the shop with the event enext1. The customer gets a chair by calling the event ehaircut1 (as long as their is an available chair). Then the barber starts the haircut ...

... Navy ; Mr. Harry L. Underwood , Solicitor of the Department of Justice ; Mr. Oscar Sutor , appearing for the Standard ... man by the name of Ryan was appointed to make an investigation of the land ... PT 13-18 If I may say , Mr. Secretary , I ...

... Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008 ... Sipser [4]: Lemma 8. D(FORKon) > |(log n)/4] - [log () D It remains to give ... solution such that (a, y, i) e FORKøn. D Theorem 10. There eatist infinitely many ...

... Computer Science Logic, pp. 46–61. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2012) 3. Bainbridge, E. S., Freyd, P. J., Scedrov, A., Scott, P. J.: Functorial Polymorphism. Theoretical Computer Science 70, 35–64 (1990) 4. Bird, R ...

... Computer Science , FSTTCS 2017 , December 11-15 , 2017 , Kanpur , India . Ed ... Notes in Computer Science . Springer , 1991 , pp . 162–173 . DOI : 10.1007 ... Neeraj Verma , Helmut Seidl , and Thomas Schwentick . " On the Complexity of ...

... (G XM | U£), to analyze strategies of player 2 on the synchronous product, i.e., we consider the player-2 MDP obtained after fixing the memoryless strategy G° in G X M, and then restrict the MDP to the set U*. Two key components. The ...

... sim invariants that hold whenever the play is in the sim gadget (in all ... 2 while |gc | is incremented by 1 (and similar arguments can be applied for ... cheats a zero-test, then player 2 invokes a blame gadget. If the sim invariants ...

... Arrows. as. a. Special. Case. of. Relative. Monads. We now turn to a whole class of examples, Hughes's arrows [9]. As we shall ... R(X, Y), – for any X,Y,Z ∈ |J|, a function (≪) ∈ R(Y,Z) × R(X, Y) → R(X,Z), satisfying the conditions – ...

... CCS , Notice that decidability of convergence in CCS , " can be reduced to the decidability of convergence in CCS , " . Proposition 3. For every P in CCS , " one can effectively construct a CCS , " process P ' , such that P converges if ...