?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=A+decision+procedure+for+satisfiability+in+separation+logic+with+inductive+predicates&rft.creator=Brotherston%2C+J&rft.creator=Fuhs%2C+C&rft.creator=P%C3%A9rez%2C+JAN&rft.creator=Gorogiannis%2C+N&rft.description=We+show+that+the+satisfiability+problem+for+the+%22symbolic+heap%22+fragment+of+separation+logic+with+general+inductively+defined+predicates-+which+includes+most+fragments+employed+in+program+verification+-+is+decidable.+Our+decision+procedure+is+based+on+the+computation+of+a+certain+fixed+point+from+the+definition+of+an+inductive+predicate%2C+called+its+%22base%22%2C+that+exactly+characterises+its+satisfiability.+A+complexity+analysis+of+our+decision+procedure+shows+that+it+runs%2C+in+the+worst+case%2C+in+exponential+time.+In+fact%2C+we+show+that+the+satisfiability+problem+for+our+inductive+predicates+is+EXPTIME-+complete%2C+and+becomes+NP-complete+when+the+maximum+arity+over+all+predicates+is+bounded+by+a+constant.+Finally%2C+we+provide+an+implementation+of+our+decision+procedure%2C+and+analyse+its+performance+both+on+a+synthetically+generated+set+of+test+formulas%2C+and+on+a+second+test+set+harvested+from+the+separation+logic+literature.+For+the+large+majority+of+these+test+cases%2C+our+tool+reports+times+in+the+low+milliseconds.+Copyright+%C2%A9+2014+ACM.&rft.publisher=Association+for+Computing+Machinery+(ACM)&rft.date=2014-08&rft.type=Proceedings+paper&rft.language=eng&rft.source=+++++In%3A++Proceedings+of+the+Joint+Meeting+of+the+23rd+EACSL+Annual+Conference+on+Computer+Science+Logic%2C+CSL+2014+and+the+29th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science%2C+LICS+2014.++++Association+for+Computing+Machinery+(ACM)%3A+New+York%2C+US.+(2014)+++++&rft.format=application%2Fpdf&rft.identifier=https%3A%2F%2Fdiscovery.ucl.ac.uk%2Fid%2Feprint%2F1455002%2F2%2Fa25-brotherston.pdf&rft.identifier=https%3A%2F%2Fdiscovery.ucl.ac.uk%2Fid%2Feprint%2F1455002%2F&rft.rights=open